Enhanced block-request streaming system using signaling or block creation

ABSTRACT

A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server. The system might include controlling the sequence, timing and construction of block requests, time based indexing, variable block sizing, optimal block partitioning, control of random access point placement, including across multiple presentation versions, dynamically updating presentation data, and/or efficiently presenting live content and time shifting.

CROSS-REFERENCES TO RELATED APPLICATIONS

The present application is a divisional of U.S. patent application Ser.No. 12/887,476, filed Sep. 21, 2010, which is a Nonprovisional PatentApplication claiming benefit under 35 USC §119(e) of the followingprovisional applications, each naming Michael G. Luby, et al. and eachentitled “Enhanced Block Request Streaming System”:

U.S. Provisional Patent Application No. 61/244,767, filed Sep. 22, 2009,

U.S. Provisional Patent Application No. 61/257,719, filed Nov. 3, 2009,

U.S. Provisional Patent Application No. 61/258,088, filed Nov. 4, 2009,

U.S. Provisional Patent Application No. 61/285,779, filed Dec. 11, 2009,and

U.S. Provisional Patent Application No. 61/296,725, filed Jan. 20, 2010.

This application also claims benefit under 35 USC §119(e) of U.S.Provisional Patent Application No. 61/372,399, filed Aug. 10, 2010,naming Ying Chen, et al. and entitled “HTTP Streaming Extensions”.

Each provisional application cited above is hereby incorporated byreference for all purposes. The present disclosure also incorporates byreference, as if set forth in full in this document, for all purposes,the following commonly assigned applications/patents:

U.S. Pat. No. 6,307,487 to Luby (hereinafter “Luby I”);

U.S. Pat. No. 7,068,729 to Shokrollahi, et al. (hereinafter “ShokrollahiI”);

U.S. patent application Ser. No. 11/423,391 filed Jun. 9, 2006 andentitled “Forward Error-Correcting (FEC) Coding and Streaming” namingLuby, et al. (hereinafter “Luby II”);

U.S. patent application Ser. No. 12/103,605 filed Apr. 15, 2008 entitled“Dynamic Stream Interleaving and Sub-Stream Based Delivery” naming Luby,et al. (hereinafter “Luby III”);

U.S. patent application Ser. No. 12/705,202 filed Feb. 12, 2010 entitled“Block Partitioning for a Data Stream” naming Pakzad, et al.(hereinafter “Pakzad”); and

U.S. patent application Ser. No. 12/859,161 filed Aug. 18, 2010 entitled“Methods and Apparatus Employing FEC Codes with Permanent Inactivationof Symbols for Encoding and Decoding Processes” naming Luby, et al.(hereinafter “Luby IV”).

FIELD OF THE INVENTION

The present invention relates to improved media streaming systems andmethods, more particularly to systems and methods that are adaptive tonetwork and buffer conditions in order to optimize a presentation ofstreamed media and allows for efficient concurrent, ortimely-distributed, delivery of streamed media data.

BACKGROUND OF THE INVENTION

Streaming media delivery may become increasingly important as it becomesmore common for high quality audio and video to be delivered overpacket-based networks, such as the Internet, cellular and wirelessnetworks, powerline networks, and other types of networks. The qualitywith which the delivered streaming media can be presented may depend ona number of factors, including the resolution (or other attributes) ofthe original content, the encoding quality of the original content, thecapabilities of the receiving devices to decode and present the media,timeliness and quality of the signal received at the receivers, etc. Tocreate a perceived good streaming media experience, transport andtimeliness of the signal received at receivers may be especiallyimportant. Good transport may provide fidelity of the stream received atthe receiver relative to what a sender sends, while timeliness mayrepresent how quickly a receiver can start playing out the content afteran initial request for that content.

A media delivery system can be characterized as a system having mediasources, media destinations, and channels (in time and/or space)separating sources and destinations. Typically, a source includes atransmitter with access to media in electronically manageable form, anda receiver with an ability to electronically control receipt of themedia (or an approximation thereof) and provide it to a media consumer(e.g., a user having a display device coupled in some way to thereceiver, a storage device or element, another channel, etc.).

While many variations are possible, in a common example, a mediadelivery system has one or more servers that have access to mediacontent in electronic form, and one or more client systems or devicesmake requests for media to the servers, and the servers convey the mediausing a transmitter as part of the server, transmitting to a receiver atthe client so that the received media can be consumed by the client insome way. In a simple example, there is one server and one client, for agiven request and response, but that need not be the case.

Traditionally, media delivery systems may be characterized into either a“download” model or “streaming” model. The “download” model might becharacterized by timing independence between the delivery of the mediadata and the playout of the media to the user or recipient device.

As an example, media is downloaded for enough in advance of when it isneeded or will be used and when it is used, as much as is needed isalready available at the recipient. Delivery in the download context isoften performed using a file transport protocol, such as HTTP, FTP orFile Delivery over Unidirectional Transport (FLUTE) and the deliveryrate might be determined by an underlying flow and/or congestion controlprotocol, such as TCP/IP. The operation of the flow or congestioncontrol protocol may be independent of the playout of the media to theuser or destination device, which may take place concurrently with thedownload or at some other time.

The “streaming” mode might be characterized by a tight coupling betweenthe timing of the delivery of the media data and the playout of themedia to the user or recipient device. Delivery in this context is oftenperformed using a streaming protocol, such as the Real Time StreamingProtocol (RTSP) for control and the Real Time Transport Protocol (RTP)for the media data. The delivery rate might be determined by a streamingserver, often matching the playout rate of the data.

Some disadvantages of the “download” model may be that, due to thetiming independence of the delivery and playout, either media data maynot be available when it is needed for playout (for example due to theavailable bandwidth being less than the media data rate), causingplayout to stop momentarily (“stalling”), which results in a poor userexperience, or media data may be required to be downloaded very far inadvance of playout (for example due to the available bandwidth beinggreater than the media data rate), consuming storage resources on thereceiving device, which may be scarce, and consuming valuable networkresources for the delivery which may be wasted if the content is not,eventually, played out or otherwise used.

An advantage of the “download” model may be that the technology neededto perform such downloads, for example HTTP, is very mature, widelydeployed and applicable across a wide range of applications. Downloadservers and solutions for massive scalability of such file downloads(for example, HTTP Web Servers and Content Delivery Networks) may bereadily available, making deployment of services based on thistechnology simple and low in cost.

Some disadvantages of the “streaming” model may be that generally therate of delivery of media data is not adapted to the available bandwidthon the connection from server to client and that specialized streamingservers or more complex network architecture providing bandwidth anddelay guarantees are required. Although streaming systems exist whichsupport variation of the delivery data rate according to availablebandwidth (for example Adobe Flash Adaptive Streaming), these aregenerally not as efficient as download transport flow control protocolssuch as TCP at utilizing all the available bandwidth.

Recently, new media delivery systems based on a combination of the“streaming” and “download” models have been developed and deployed. Anexample of such a model is referred to herein as a “block-requeststreaming” model, wherein a media client requests blocks of media datafrom serving infrastructure using a download protocol, such as HTTP. Aconcern in such systems may be the ability to start playing out astream, for example decoding and rendering received audio and videostreams using a personal computer and displaying the video on a computerscreen and playing the audio through built in speakers, or as anotherexample decoding and rendering received audio and video streams using aset top box and displaying the video on a television display device andplaying the audio through a stereo system.

Other concerns, such as being able to decode the source blocks fastenough to keep up with the source streaming rate, to minimize thedecoding latency and to reduce the use of available CPU resources areissues. Another concern is to provide a robust and scalable streamingdelivery solution that allows components of the system to fail withoutadversely affecting the quality of the streams delivered to receivers.Other problems might occur based on rapidly changing information about apresentation, as it is being distributed. Thus, it is desirable to haveimproved processes and apparatus.

BRIEF SUMMARY OF THE INVENTION

A block-request streaming system provides for improvements in the userexperience and bandwidth efficiency of such systems, typically using aningestion system that generates data in a form to be served by aconventional file server (HTTP, FTP, or the like), wherein the ingestionsystem intakes content and prepares it as files or data elements to beserved by the file server, which might or might not include a cache. Aclient device can be adapted to take advantage of the ingestion processas well as including improvements that make for a better presentationindependent of the ingestion process.

These embodiments include novel improvements to methods used at ablock-request streaming client and at a block request ingestion systemto determine the sequence, timing and construction of block requestsincluding the provision of time based indexing. In some embodiments,novel improvements to methods for block and file construction includingvariable block sizing and optimal block partitioning are provided. Insome embodiments, novel improvements to methods of random access pointplacement, including random access point placement across multiplepresentation versions are provided. In some embodiments, novelimprovements to methods of dynamically updating presentation dataincluding signaling within metadata are provided. In some embodiments,novel improvements to methods for efficiently presenting live contentand time shifting are provided.

The following detailed description together with the accompanyingdrawings will provide a better understanding of the nature andadvantages of the present invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts elements of a block-request streaming system according toembodiments of the present invention.

FIG. 2 illustrates the block-request streaming system of FIG. 1, showinggreater detail in the elements of a client system that is coupled to ablock serving infrastructure (“BSI”) to receive data that is processedby a content ingestion system.

FIG. 3 illustrates a hardware/software implementation of an ingestionsystem.

FIG. 4 illustrates a hardware/software implementation of a clientsystem.

FIG. 5 illustrates possible structures of the content store shown inFIG. 1, including segments and media presentation descriptor (“MPD”)files, and a breakdown of segments, timing, and other structure withinan MPD file.

FIG. 6 illustrates details of a typical source segment, as might bestored in the content store illustrated in FIGS. 1 and 5.

FIGS. 7a and 7b illustrate simple and hierarchical indexing withinfiles.

FIG. 8(a) illustrates variable block sizing with aligned seek pointsover a plurality of versions of a media stream.

FIG. 8(b) illustrates variable block sizing with non-aligned seek pointsover a plurality of versions of a media stream.

FIG. 9(a) illustrates a Metadata Table.

FIG. 9(b) illustrates the transmission of Blocks and Metadata Table fromserver to client.

FIG. 10 illustrates blocks that are independent of RAP boundaries.

FIG. 11 illustrates continuous and discontinuous timing across segments.

FIG. 12 is a figure showing an aspect of scalable blocks.

FIG. 13 depicts a graphical representation of the evolution of certainvariables within a block-request streaming system over time.

FIG. 14 depicts another graphical representation of the evolution ofcertain variables within a block-request streaming system over time.

FIG. 15 depicts a cell grid of states as a function of threshold values.

FIG. 16 is a flowchart of a process that might be performed in areceiver that can request single blocks and multiple blocks per request.

FIG. 17 is a flowchart of a flexible pipeline process.

FIG. 18 illustrates an example of a candidate set of requests, theirpriorities, and which connections that they can be issued on, at acertain time.

FIG. 19 illustrates an example of a candidate set of requests, theirpriorities, and which connections that they can be issued on, that hasevolved from one time to another.

FIG. 20 is a flowchart of consistent caching server proxy selectionbased on a file identifier.

FIG. 21 illustrates a syntax definition for a suitable expressionlanguage.

FIG. 22 illustrates an example of a suitable hash function.

FIG. 23 illustrates examples of file identifier construction rules.

FIGS. 24(a)-(e) illustrate bandwidth fluctuations of TCP connections.

FIG. 25 illustrates multiple HTTP requests for source and repair data.

FIG. 26 illustrates example channel zapping time with and without FEC.

FIG. 27 illustrates details of a repair segment generator that, as partof the ingestion system shown in FIG. 1, generates repair segments fromsource segments and control parameters.

FIG. 28 illustrates relationships between source blocks and repairblocks.

FIG. 29 illustrates a procedure for live services at different times atthe client.

In the figures, like items are referenced with like numbers andsub-indices are provided in parentheses to indicate multiple instancesof like or identical items. Unless otherwise indicated, the finalsub-index (e.g., “N” or “M”) is not intended to be limiting to anyparticular value and the number of instances of one item can differ fromthe number of instances of another item even when the same number areillustrated and the sub-index is reused.

DETAILED DESCRIPTION OF THE INVENTION

As described herein, a goal of a streaming system is to move media fromits storage location (or the location where it is being generated) to alocation where it is being consumed, i.e., presented to a user orotherwise “used up” by a human or electronic consumer. Ideally, thestreaming system can provide uninterrupted playback (or more generally,uninterrupted “consumption”) at a receiving end and can begin playing astream or a collection of streams shortly after a user has requested thestream or streams. For efficiency reasons, it is also desirable thateach stream be halted once the user indicates that the stream is nolonger needed, such as when the user is switching from one stream toanother stream or it obeys the presentation of a stream, e.g., the“subtitle” stream. If the media component, such as the video, iscontinued to be presented, but a different stream is selected to presentthis media component, it is often preferred to occupy limited bandwidthwith the new stream and stop the old stream.

A block-request streaming system according to embodiments describedherein provides many benefits. It should be understood that a viablesystem need not include all of the features described herein, as someapplications might provide a suitably satisfying experience with lessthan all of the features described herein.

HTTP Streaming

HTTP streaming is a specific type of streaming With HTTP streaming, thesources might be standard web servers and content delivery networks(CDNs) and might use standard HTTP. This technique may involve streamsegmentation and the use of multiple streams, all within the context ofstandardized HTTP requests. The media, such as video, may by encoded atmultiple bitrates to form different versions, or representations. Theterms “version” and “representation” are used synonymously in thisdocument. Each version or representation may be broken into smallerpieces, perhaps on the order of a few seconds each, to form segments.Each segment may then be stored on a web server or CDN as a separatefile.

On the client side, requests may then be made, using HTTP, forindividual segments that are seamlessly spliced together by the client.The client may switch to different data rates based on availablebandwidth. The client may also request multiple representations, eachpresenting a different media component, and may present the media inthese representations jointly and synchronously. Triggers for switchingmay include buffer occupancy and network measurements, for example. Whenoperating in the steady state, the client may pace requests to theserver to maintain a target buffer occupancy.

Advantages of HTTP streaming may include bit-rate adaptation, faststartup and seek, and minimal unnecessary delivery. These advantagescome from controlling the delivery to be only a short time ahead of theplayout, making maximum use of available bandwidth (through variable bitrate media), and optimizing stream segmentation and intelligent clientprocedures.

A media presentation description may be provided to an HTTP streamingclient such that the client can use a collection of files (for examplein formats specified by 3GPP, herein called a 3gp segments) to provide astreaming service to the user. A media presentation description, andpossibly updates of this media presentation description, describe amedia presentation that is a structured collection of segments, eachcontaining media components such that the client can present theincluded media in a synchronized manner and can provide advancedfeatures, such as seeking, switching bitrates and joint presentation ofmedia components in different representations. The client may use themedia presentation description information in different ways for theprovisioning of the service. In particular, from the media presentationdescription, the HTTP streaming client may determine which segments inthe collection can be accessed so that that the data is useful to theclient capability and the user within the streaming service.

In some embodiments, the media presentation description may be static,although segments might be created dynamically. The media presentationdescription may be as compact as possible to minimize access anddownload time for the service. Other dedicated server connectivity maybe minimized, for example regular or frequent timing synchronizationbetween client and server.

The media presentation may be constructed to permit access by terminalswith different capabilities, such as access to different access networktypes, different current network conditions, display sizes, accessbitrates and codec support. The client may then extract the appropriateinformation to provide the streaming service to the user.

The media presentation description may also permit deploymentflexibility and compactness according to the requirements.

In a simplest case, each Alternative Representation may be stored in asingle 3GP file, i.e., a file conforming as defined in 3GPP TS26.244, orany other file that conforms to the ISO base media file format asdefined in ISO/IEC 14496-12 or derived specifications (such as the 3GPfile format described in 3GPP Technical Specification 26.244). In theremainder of this document, when referring to a 3GP file, it should beunderstood that ISO/IEC 14496-12 and derived specifications can map alldescribed features to the more general ISO base media file format asdefined in ISO/IEC 14496-12 or any derived specifications. The clientmay then request an initial portion of the file to learn the mediametadata (which typically is stored in the Movie header box, alsoreferred to as “moov” box) together with movie fragment times and byteoffsets. The client may then issue HTTP partial get requests to obtainmovie fragments as required.

In some embodiments it may be desirable to split each representationinto several segments, where the segments. In case that the segmentformat is based on the 3GP file format, then segments containnon-overlapping time slices of the movie fragments, called “time-wisesplitting”. Each of these segments may contain multiple movie fragmentsand each may be a valid 3GP file in its own right. In anotherembodiment, the representation is split into an initial segmentcontaining the metadata (typically the Movie Header “moov” box) and aset of media segments, each containing media data and the concatenationof the initial segment and any media segment forms a valid 3GP file aswell as the concatenation of the initial segment and all media segmentsof one representation forms a valid 3GP file. The entire presentationmay be formed by playing out each segment in turn, mapping the localtimestamps within the file to the global presentation time according tothe start time of each representation.

It should be noted that throughout this description references to a“segment” should be understood to include any data object which is fullyor partially constructed or read from a storage medium or otherwiseobtained as a result of a file download protocol request, including forexample an HTTP request. For example, in the case of HTTP, the dataobjects may be stored in actual files residing on a disk or otherstorage medium connected to or forming part of an HTTP server, or thedata objects may be constructed by a CGI script, or other dynamicallyexecuted program, which is executed in response to the HTTP request. Theterms “file” and “segment” are used synonymously in this document unlessotherwise specified. In the case of HTTP, the segment may be consideredas the entity body of an HTTP request response.

The terms “presentation” and “content item” are used synonymously inthis document. In many examples, the presentation is an audio, video orother media presentation that has a defined “playout” time, but othervariations are possible.

The terms “block” and “fragment” are used synonymously in this documentunless otherwise specified and generally refer to the smallestaggregation of data that is indexed. Based on the available indexing, aclient can request different portions of a fragment in different HTTPrequests, or can request one or more consecutive fragments or portionsof fragments in one HTTP request. In the case where ISO base media fileformat based segments or 3GP file format based segments are used, afragment typically refers to a movie fragment defined as the combinationof a movie fragment header (‘moof’) box and a media data (‘mdat’) box.

Herein, a network carrying data is assumed to be packet-based in orderto simplify the descriptions herein, with the recognition that, afterreading this disclosure, one skilled in the art can apply embodiments ofthe present invention described herein to other types of transmissionnetworks, such as continuous bit-stream networks.

Herein, FEC codes are assumed to provide protection against long andvariable delivery times of data, in order to simplify the descriptionsherein, with the recognition that, after reading this disclosure, oneskilled in the art can apply embodiments of the present invention toother types of data transmission issues, such a bit-flip corruption ofdata. For example, without FEC, if the last portion of a requestedfragment arrives much later or has high variance in its arrival timethan previous portions of the fragment then the content zapping time canbe large and variable, whereas using FEC and parallel requests, only themajority of the data requested for a fragment need arrive before it canbe recovered, thereby reducing content zapping time and the variabilityin content zapping time. In this description, it might be assumed thatthe data to be encoded (i.e., source data) has been broken into equallength “symbols”, which may be of any length (down to a single bit), butsymbols could be of different lengths for different parts of the data,e.g., different symbol sizes might be used for different blocks of data.

In this description, in order to simplify the descriptions herein, it isassumed that the FEC is applied to a “block” or “fragment” of data at atime, i.e., a “block” is a “source block” for FEC encoding and decodingpurposes. A client device can use the segment indexing described hereinto help to determine the source block structure of a segment. Oneskilled in the art can apply embodiments of the present invention toother types of source block structures, e.g., a source block may be aportion of a fragment, or encompass one or more fragments or portions offragments.

The FEC codes considered for use with block-request streaming aretypically systematic FEC codes, i.e., the source symbols of the sourceblock may be included as part of the encoding of the source block andthus the source symbols are transmitted. As one skilled in the art willrecognize, the embodiments described herein apply equally well to FECcodes that are not systematic. A systematic FEC encoder generates, froma source block of source symbols, some number of repair symbols and thecombination of at least some of the source and repair symbols are theencoded symbols that are sent over the channel representing the sourceblock. Some FEC codes may be useful for efficiently generating as manyrepair symbols as needed, such as “information additive codes” or“fountain codes” and examples of these codes include “chain reactioncodes” and “multi-stage chain reaction codes”. Other FEC codes such, asReed-Solomon codes may practically only generate a limited number ofrepair symbols for each source block.

It is assumed in many of these examples that a client is coupled to amedia server or a plurality of media servers and the client requestsstreaming media over a channel or a plurality of channels from the mediaserver or the plurality of media servers. However, more involvedarrangements are also possible.

Examples of Benefits

With block-request streaming, the media client maintains a couplingbetween the timing of these block requests and the timing of the mediaplayout to the user. This model may retain the advantages of the“download” model described above, while avoiding some of thedisadvantages that stem from the usual de-coupling of media playout fromdata delivery. The block-request streaming model makes use of the rateand congestion control mechanisms available in transport protocols, suchas TCP, to ensure that the maximum available bandwidth is used for mediadata. Additionally, the division of the media presentation into blocksallows each block of encoded media data to be selected from a set ofmultiple available encodings.

This selection may be based on any number of criteria, includingmatching of the media data rate to the available bandwidth, even whenthe available bandwidth is changing over time, matching of the mediaresolution or decoding complexity to client capabilities orconfiguration, or matching to user preferences, such as languages. Theselection may also include the download and presentation of auxiliarycomponents, such as accessibility components, closed captioning,sub-titles, sign language video, etc. Examples of existing systems usingthe block-request streaming model include Move Networks™, MicrosoftSmooth Streaming and the Apple iPhone™ Streaming Protocol.

Commonly, each block of media data may be stored on a server as anindividual file and then a protocol, such as HTTP, is used, inconjunction with HTTP server software executed on the server, to requestthe file as a unit. Typically, the client is provided with metadatafiles, which may for example be in Extensible Markup Language (XML)format or in playlist text format or in binary format, which describefeatures of the media presentation, such as the available encodings (forexample, required bandwidth, resolutions, encoding parameters, mediatype, language), typically referred to as “representations” in thisdocument, and the manner in which the encodings have been divided intoblocks. For example, the metadata may include a Uniform Resource Locator(URL) for each block. The URLs itself may provide a scheme such as beingprepended with the string “http://” to indicate that protocol that is tobe used to access the documented resource is HTTP. Another example is“ftp://” to indicate that the protocol that is to be used is FTP.

In other systems, for example, the media blocks may be constructed“on-the-fly” by the server in response to a request from the client thatindicates the portion of the media presentation, in time, that isrequested. For example, in case of HTTP with scheme “http://”, theexecution of the request of this URL provides a request response thatcontains some specific data in the entity body of this request response.The implementation in the network on how to generate this requestresponse may be quite different, depending on the implementation of theserver servicing such requests.

Typically, each block may be independently decodable. For example in thecase of video media, each block may begin with a “seek point.” In somecoding schemes, a seek point is referred to as “Random Access Points” or“RAPs”, although not all RAPs may be designated as a seek point.Similarly, in other coding schemes, a seek point starts at a“Independent Data Refresh” frame, or “IDR”, in the case of H.264 videoencoding, although not all IDRs may be designated as a seek point. Aseek point is a position in video (or other) media where a decoder canstart decoding without requiring any data about prior frames or data orsamples, as might be the case where a frame or sample that is beingdecoded was encoded not in a stand-alone fashion, but as, for example,the difference between the current frame and the prior frame.

A concern in such systems may be the ability to start playing out astream, for example decoding and rendering received audio and videostreams using a personal computer and displaying the video on a computerscreen and playing the audio through built in speakers, or as anotherexample decoding and rendering received audio and video streams using aset top box and displaying the video on a television display device andplaying the audio through a stereo system. A primary concern may be tominimize the delay between when a user decides to watch a new contentdelivered as a stream and takes an action that expresses that decision,e.g., the user clicks on a link within a browser window or on the playbutton of a remote control device, and when the content starts beingdisplayed on the user's screen, hereinafter called the “content zappingtime”. Each of these concerns can be addressed by elements of theenhanced system described herein.

An example of content zapping is when a user is watching a first contentdelivered via a first stream and then the user decides to watch a secondcontent delivered via a second stream and initiates an action to startwatching the second content. The second stream may be sent from the sameset or a different set of servers as the first stream. Another exampleof content zapping is when a user is visiting a website and decides tostart watching a first content delivered via a first stream by clickingon a link within the browser window. In a similar manner, a user maydecide to start playing the content not from the beginning, but fromsome time within the stream. The user indicates to their client deviceto seek to a time position and the user might expect that the selectedtime is rendered instantaneously. Minimizing content zapping time isimportant for video watching to allow users a high quality fast contentsurfing experience when searching and sampling a wide range of availablecontents.

Recently, it has become common practice to consider using Forward ErrorCorrection (FEC) codes for protection of streaming media duringtransmission. When sent over a packet network, examples of which includethe Internet and wireless networks such as those standardized by groupssuch as 3GPP, 3GPP2 and DVB, the source stream is placed into packets asit is generated or made available, and thus the packets may be used tocarry the source or content stream in the order it is generated or madeavailable to receivers.

In a typical application of FEC codes to these types of scenarios, anencoder may use FEC code in the creation of repair packets, which arethen sent in addition to the original source packets containing thesource stream. The repair packets have a property that, when sourcepacket loss occurs, received repair packets may be used to recover thedata contained in the lost source packets. Repair packets can be used torecover content of lost source packets that are lost entirely, but mightalso be used to recover from partial packet loss occurs, either entirelyreceived repair packets or even partially received repair packets. Thus,wholly or partially received repair packets can be used to recoverwholly or partially lost source packets.

In yet other examples, other types of corruption can occur to the sentdata, e.g., values of bits may be flipped, and thus repair packets maybe used to correct such corruption and provide as accurate as possiblerecovery of the source packets. In other examples, the source stream isnot necessarily sent in discrete packets, but instead may be sent forexample as a continuous bit stream.

There are many examples of FEC codes that can be used to provideprotection of a source stream. Reed-Solomon codes are well known codesfor error and erasure correction in communication systems. For erasurecorrection over, for example, packet data networks, a well-knownefficient implementation of Reed-Solomon codes uses Cauchy orVandermonde matrices as described in L. Rizzo, “Effective Erasure Codesfor Reliable Computer Communication Protocols”, Computer CommunicationReview, 27(2):24-36 (April 1997) (hereinafter “Rizzo”) and Bloemer, etal., “An XOR-Based Erasure-Resilient Coding Scheme”, Technical ReportTR-95-48, International Computer Science Institute, Berkeley, Calif.(1995) (hereinafter “XOR-Reed-Solomon”) or elsewhere.

Other examples of FEC codes include LDPC codes, chain reaction codessuch as those described in Luby I and multi-stage chain reaction codessuch in Shokrollahi I.

Examples of the FEC decoding process for variants of Reed-Solomon codesare described in Rizzo and XOR-Reed-Solomon. In those examples, decodingmay be applied after sufficient source and repair data packets have beenreceived. The decoding process may be computationally intensive and,depending on the CPU resources available, this may take considerabletime to complete, relative to the length of time spanned by the media inthe block. The receiver may take into account this length of timerequired for decoding when calculating the delay required between thestart of reception of the media stream and play-out of the media. Thisdelay due to decoding is perceived by the user as a delay between theirrequest for a particular media stream and the start of playback. It isthus desirable to minimize this delay.

In many applications, packets may be further subdivided into symbols onwhich the FEC process is applied. A packet can contain one or moresymbol (or less than one symbol, but usually symbols are not splitacross groups of packets unless the error-conditions among groups ofpackets is known to be highly correlated). A symbol can have any size,but often the size of a symbol is at most equal to the size of thepacket. Source symbols are those symbols that encode the data that is tobe transmitted. Repair symbols are symbols generated from sourcesymbols, directly or indirectly that are in addition to the sourcesymbols (i.e., the data to be transmitted can be entirely recovered ifall of the source symbols are available and none of the repair symbolsare available.

Some FEC codes may be block-based, in that encoding operations depend onthe symbol(s) that are in a block and can be independent of the symbolsnot in that block. With block-based encoding, an FEC encoder cangenerate repair symbols for a block from the source symbols in thatblock, then move on to the next block and not need to refer to sourcesymbols other than those for the current block being encoded. In atransmission, a source block comprising source symbols may berepresented by an encoded block comprising encoded symbols (which mightbe some source symbols, some repair symbols, or both). With the presenceof repair symbols, not all of the source symbols are required in everyencoded block.

For some FEC codes, notably Reed-Solomon codes, the encoding anddecoding time may grow impractical as the number of encoded symbols persource block grows. Thus, in practice, there is often a practical upperbound (255 is an approximate practical limit for some applications) onthe total number of encoded symbols that can be generated per sourceblock, especially in a typical case where the Reed-Solomon encoding ordecoding process is performed by custom hardware, e.g., the MPE-FECprocesses that use Reed-Solomon codes included as part of the DVB-Hstandard for protecting streams against packet loss are implemented inspecialized hardware within a cell phone that is limited to 255Reed-Solomon total encoded symbols per source block. Since symbols areoften required to be placed into separate packet payloads, this places apractical upper bound on the maximum length of the source block beingencoded. For example, if a packet payload is limited to 1024 bytes orless and each packet carries one encoded symbol, then an encoded sourceblock can be at most 255 kilobytes, and this is also, of course, anupper bound on the size of the source block itself.

Other concerns, such as being able to decode the source blocks fastenough to keep up with the source streaming rate, to minimize thedecoding latency introduced by FEC decoding, and to only use a smallfraction of the available CPU on the receiving device at any point intime during FEC decoding are addressed by elements described herein, aswell as dealing with

The need to provide a robust and scalable streaming delivery solutionthat allows components of the system to fail without adversely affectingthe quality of the streams delivered to receivers.

A block request streaming system needs to support changes to thestructure or metadata of the presentation, for example changes to thenumber of available media encodings or changes to the parameters of themedia encodings such as bit rate, resolution, aspect ratio, audio orvideo codecs or codec parameters of changes in other metadata such asURLs associated with the content files. Such changes may be required fora number of reasons including editing together content from differentsources such as advertising or different segments of a largerpresentation, modification of URLs or other parameters which becomenecessary as a result of changes in the serving infrastructure forexample due to configuration changes, equipment failures or recoveryfrom equipment failures or other reasons.

Methods exist in which a presentation may be controlled by acontinuously updated playlist file. Since this file is continuouslyupdated, then at least some of the changes described above can be madewithin these updates. A disadvantage of a conventional method is thatclient devices must continually retrieve, also referred to as “polling”,the playlist file, placing load on the serving infrastructure and thatthis file may not be cached for longer than the update interval, makingthe task for the serving infrastructure much more difficult. This isaddressed by elements herein so that updates of the kind described aboveare provided without the need for continuous polling by clients for themetadata file.

Another problem, especially in the live services, typically known frombroadcast distribution, is the lack of ability for the user to viewcontent that has been broadcast earlier than the time when the userjoined the program. Typically, local personal recording consumesunnecessary local storage or is not possible as the client was not tunedto the program or is prohibited by content protection rules. Networkrecording and time-shift viewing is preferred, but requires individualconnections of the user to the server and a separate delivery protocoland infrastructure than the live services, resulting in duplicatedinfrastructure and significant server costs. This is also addressed byelements described herein.

System Overview

One embodiment of the invention is described with reference to FIG. 1,which shows a simplified diagram of a block-request streaming systemembodying the invention.

In FIG. 1, a block-streaming system 100 is illustrated, comprising blockserving infrastructure (“BSI”) 101 in turn comprising an ingestionsystem 103 for ingesting content 102, preparing that content andpackaging it for service by an HTTP streaming server 104 by storing itinto a content store 110 that is accessible to both ingestion system 103and HTTP streaming server 104. As shown, system 100 might also includean HTTP cache 106. In operation, a client 108, such as an HTTP streamingclient, sends requests 112 to HTTP streaming server 104 and receivesresponses 114 from HTTP streaming server 104 or HTTP cache 106. In eachcase, elements shown in FIG. 1 might be implemented, at least in part,in software, therein comprising program code that is executed on aprocessor or other electronics.

The content might comprise movies, audio, 2D planar video, 3D video,other types of video, images, timed text, timed metadata or the like.Some content might involve data that is to be presented or consumed in atimed manner, such as data for presenting auxiliary information (stationidentification, advertising, stock quotes, Flash™ sequences, etc.) alongwith other media being played out. Other hybrid presentations might alsobe used that combine other media and/or go beyond merely audio andvideo.

As illustrated in FIG. 2, media blocks may be stored within a blockserving infrastructure 101(1), which could be, for example, an HTTPserver, a Content Delivery Network device, an HTTP proxy, FTP proxy orserver, or some other media server or system. Block servinginfrastructure 101(1) is connected to a network 122, which could be, forexample, an Internet Protocol (“IP”) network such as the Internet. Ablock-request streaming system client is shown having six functionalcomponents, namely a block selector 123, provided with the metadatadescribed above and performing a function of selecting blocks or partialblocks to be requested from among the plurality of available blocksindicated by the metadata, a block requestor 124, that receives requestinstructions from block selector 123 and performs the operationsnecessary to send a request for the specified block, portions of ablock, or multiple blocks, to block serving infrastructure 101(1) overnetwork 122 and to receive the data comprising the block in return, aswell as a block buffer 125, a buffer monitor 126, a media decoder 127and one or more media transducers 128 that faciliate media consumption.

Block data received by block requestor 124 is passed for temporarystorage to block buffer 125, which stores the media data. Alternatively,the received block data can be stored directly into block buffer 125 asillustrated in FIG. 1. Media decoder 127 is provided with media data byblock buffer 125 and performs such transformations on this data as arenecessary to provide suitable input to media transducers 128, whichrender the media in a form suitable for user or other consumption.Examples of media transducers include visual display devices such asthose found in mobile phones, computer systems or televisions, and mightalso include audio rendering devices, such as speakers or headphones.

An example of a media decoder would be a function that transforms datain the format described in the H.264 video coding standard into analogueor digital representations of video frames, such as a YUV-format pixelmap with associated presentation timestamps for each frame or sample.

Buffer monitor 126 receives information concerning the contents of blockbuffer 125 and, based on this information and possibly otherinformation, provides input to block selector 123, which is used todetermine the selection of blocks to request, as is described herein.

In the terminology used herein, each block has a “playout time” or“duration” that represents the amount of time it would take for thereceiver to play the media included in that block at normal speed. Insome cases, the playout of the media within a block may depend on havingalready received data from previous blocks. In rare cases, the playoutof some of the media in a block may depend on a subsequent block, inwhich case the playout time for the block is defined with respect to themedia that can be played out within the block without reference to thesubsequent block, and the playout time for the subsequent block isincreased by the playout time of the media within this block that canonly playout after having received the subsequent block. Since includingmedia in a block that depends on subsequent blocks is a rare case, inthe remainder of this disclosure we assume that media in one block doesnot depend on subsequent blocks, but note that those skilled in the artwill recognize that this variant can be easily added to the embodimentsdescribed below.

The receiver may have controls such as “pause”, “fast forward”,“reverse”, etc. that may result in the block being consumed by playoutat a different rate, but if the receiver can obtain and decode eachconsecutive sequence of blocks in an aggregate time equal to or lessthan their agreggate playout time excluding the last block in thesequence then the receiver can present the media to the user withoutstalling. In some descriptions herein, a particular position in themedia stream is referred to as a particular “time” in the media,corresponding to the time that would have elapsed between the beginningof the media playout and the time when the particular position in thevideo stream is reached. The time or position in a media stream is aconventional concept. For example, where the video stream comprises 24frames per second, the first frame could be said to have a position ortime of t=0.0 seconds and the 241st frame could be said to have aposition or time of t=10.0 seconds. Naturally, in a frame-based videostream, position or time need not be continuous, as each of the bits inthe stream from the first bit of the 241st frame to just before thefirst bit of the 242nd frame might all have the same time value.

Adopting the above terminology, a block-request streaming system (BRSS)comprises one or more clients that make requests to one or more contentservers (for example, HTTP servers, FTP Servers, etc.). An ingestionsystem comprises one or more ingestion processors, wherein an ingestionprocessor receives content (in real-time or not), processes the contentfor use by the BRSS and stores it into storage accessible to the contentservers, possibly also along with metadata generated by the ingestionprocessor.

The BRSS also might contain content caches that coordinate with thecontent servers. The content servers and content caches might beconventional HTTP servers and HTTP caches that receive requests forfiles or segments in the form of HTTP requests that include a URL, andmay also include a byte range, in order to request less than all of thefile or segment indicated by the URL. The clients might include aconventional HTTP client that makes requests of HTTP servers and handlesthe responses to those requests, where the HTTP client is driven by anovel client system that formulates requests, passes them to the HTTPclient, gets responses from the HTTP client and processes those (orstoring, transforming, etc.) in order to provide them to a presentationplayer for playout by a client device. Typically, the client system doesnot know in advance what media is going to be needed (as the needs mightdepend on user input, changes in user input, etc.), so it is said to bea “streaming” system in that the media is “consumed” as soon as it isreceived, or shortly thereafter. As a result, response delays andbandwidth constraints can cause delays in a presentation, such ascausing a pause in a presentation as the stream catches up to where theuser is in consuming the presentation.

In order to provide for a presentation that is perceived to be of goodquality, a number of details can be implemented in the BRSS, either atthe client end, at the ingestion end, or both. In some cases, thedetails that are implemented are done in consideration of, and to dealwith, the client-server interface at the network. In some embodiments,both the client system and the ingestion system are aware of theenhancement, whereas in other embodiments, only one side is aware of theenhancement. In such cases, the entire system benefits from theenhancement even though one side is not aware of it, while in others,the benefit only accrues if both sides are aware of it but when one sideis not aware, it still operates without failing.

As illustrated in FIG. 3, the ingestion system may be implemented as acombination of hardware and software components, according to variousembodiments. The ingestion system may comprise a set of instructionsthat can be executed to cause the system to perform any one or more ofthe methodologies discussed herein. The system may be realized as aspecific machine in the form of a computer. The system may be a servercomputer, a personal computer (PC), or any system capable of executing aset of instructions (sequential or otherwise) that specify actions to betaken by that system. Further, while only a single system isillustrated, the term “system” shall also be taken to include anycollection of systems that individually or jointly execute a set (ormultiple sets) of instructions to perform any one or more of themethodologies discussed herein.

The ingestion system may include the ingestion processor 302 (e.g., acentral processing unit (CPU)), a memory 304 which may store programcode during execution, and disk storage 306, all of which communicatewith each other via a bus 300. The system may further include a videodisplay unit 308 (e.g., a liquid crystal display (LCD) or cathode raytube (CRT)). The system also may include an alphanumeric input device310 (e.g., a keyboard), and a network interface device 312 for receivingcontent source and delivering content store.

The disk storage unit 306 may include a machine-readable medium on whichmay be stored one or more sets of instructions (e.g., software)embodying any one or more of the methodologies or functions describedherein. The instructions may also reside, completely or at leastpartially, within the memory 304 and/or within the ingestion processor302 during execution thereof by the system, with the memory 304 and theingestion processor 302 also constituting machine-readable media.

As illustrated in FIG. 4, the client system may be implemented as acombination of hardware and software components, according to variousembodiments. The client system may comprise a set of instructions thatcan be executed to cause the system to perform any one or more of themethodologies discussed herein. The system may be realized as a specificmachine in the form of a computer. The system may be a server computer,a personal computer (PC), or any system capable of executing a set ofinstructions (sequential or otherwise) that specify actions to be takenby that system. Further, while only a single system is illustrated, theterm “system” shall also be taken to include any collection of systemsthat individually or jointly execute a set (or multiple sets) ofinstructions to perform any one or more of the methodologies discussedherein.

The client system may include the client processor 402 (e.g., a centralprocessing unit (CPU)), a memory 404 which may store program code duringexecution, and disk storage 406, all of which communicate with eachother via a bus 400. The system may further include a video display unit408 (e.g., a liquid crystal display (LCD) or cathode ray tube (CRT)).The system also may include an alphanumeric input device 410 (e.g., akeyboard), and a network interface device 412 for sending requests andreceiving responses.

The disk storage unit 406 may include a machine-readable medium on whichmay be stored one or more sets of instructions (e.g., software)embodying any one or more of the methodologies or functions describedherein. The instructions may also reside, completely or at leastpartially, within the memory 404 and/or within the client processor 402during execution thereof by the system, with the memory 404 and theclient processor 402 also constituting machine-readable media.

Usage of 3GPP File Format

The 3GPP File Format or any other file based on the ISO base media fileformat, such as the MP4 file format or the 3GPP2 file format, may beused as the container format for HTTP streaming with the followingfeatures. A segment index may be included in each segment to signal timeoffsets and byte ranges, such that the client can download theappropriate pieces of files or media segments as required. Globalpresentation timing of the entire media presentation and local timingwithin each 3GP file or media segment may be accurately aligned. Trackswithin one 3GP file or media segment may be accurately aligned. Tracksacross representations may also be aligned by assigning each of them tothe global timeline such that switching across representation may beseamless and joint presentation of media components in differentrepresentations may be synchronous.

The file format may contain a profile for Adaptive Streaming with thefollowing properties. All movie data may be contained in moviefragments—the “moov” box may not contain any sample information. Audioand Video sample data may be interleaved, with similar requirements asfor the progressive download profile as specified in TS26.244. The“moov” box may be placed at the start of the file, followed by fragmentoffset data, also referred to as a segment index, containing offsetinformation in time and byte ranges for each fragment or at least asubset of fragments in the containing segment.

It may also be possible for the Media Presentation Description toreference files that follow the existing Progressive Download profile.In this case the client may use the Media Presentation Descriptionsimply to select the appropriate alternative version from amongstmultiple available versions. Clients may also use HTTP partial getrequests with files compliant to the Progressive Download profile torequest subsets of each alternative version and thereby implement a lessefficient form of adaptive streaming. In this case the differentrepresentations containing the media in the progressive download profilemay still adhere to a common global timeline to enable seamlessswitching across representations.

Advanced Methods Overview

In the following sections, methods for improved block-request streamingsystems are described. It should be understood that some of theseimprovements can be used with or without others of these improvements,depending on the needs of the application. In the general operation, areceiver makes requests of a server or other transmitter for specificblocks or portions of blocks of data. Files, also called segments, maycontain multiple blocks and are associated with one representation of amedia presentation.

Preferably, indexing information, also called “segment indexing” or“segment map”, is generated that provides a mapping from playout ordecode times to byte offsets of corresponding blocks or fragments withina segment. This segment indexing may be included within the segment,typically at the beginning of the segment (at least some of the segmentmap is at the beginning) and is often small. The segment index may alsobe provided in a separate index segment or file. Especially in caseswhere the segment index is contained in the segment, the receiver maydownload some or all of this segment map quickly and subsequently usethis to determine the mapping between time offsets and correspondingbyte positions of fragments associated with those time offsets withinthe file.

A receiver can use the byte offset to request data from the fragmentsassociated with particular time offsets, without having to download allof the data associated with other fragments not associated with the timeoffsets of interest. In this way, the segment map or segment indexingcan greatly improve the ability of a receiver to directly access theportions of the segment that are relevant to the current time offsets ofinterest, with benefits including improved content zapping times,ability to quickly change from one representation to another as networkconditions vary, and reduced wastage of network resources downloadingmedia that is not played out at a receiver.

In case switching from one representation (referred to herein as the“switch-from” representation) to another representation (referred toherein as the “switch-to” representation) is considered, the segmentindex may also be used to identify the start time of a random accesspoint in the switch-to representation to identify the amount of data tobe requested in the switch-from representation to ensure that seamlessswitching is enabled in a sense that media in the switch-fromrepresentation is downloaded up to a presentation time such that theplayout of of the switch-to representation can start seamlessly from therandom access point.

Those blocks represent segments of the video media or other media thatthe requesting receiver needs in order to generate the output for theuser of the receiver. The receiver of the media can be a client device,such as when the receiver receives content from a server that transmitsthe content. Examples include set-top boxes, computers, game consoles,specially-equipped televisions, handheld devices, specially-equippedmobile phones, or other client receivers.

Many advanced buffer management methods are described herein. Forexample, a buffer management method enables clients to request blocks ofthe highest media quality that may be received in time to be played outwith continuity. A variable block size feature improves compressionefficiency. The ability to have multiple connections for transmittingblocks to the requesting device while limiting the frequency of therequests provides improved transmission performance. Partially receivedblocks of data can be used to continue the media presentation. Aconnection can be re-used for multiple blocks without having to committhe connection at the start to a particular set of blocks. Consistencyin the selection of servers from among multiple possible servers bymultiple clients is improved, which reduces the frequency of duplicatecontent in nearby servers and improves the probability that a servercontains an entire file. Clients can request media blocks based onmetadata (such as available media encodings) that are embedded in theURLs for the files containing the media blocks. A system can provide forcalculation and minimization of the amount of buffering time requiredbefore playout of the content can begin without incurring subsequentpauses in media playout. Available bandwidth can be shared amongmultiple media blocks, adjusted as the playout time of each blockapproaches, so that, if necessary, a greater share of availablebandwidth can be allocated towards the block with the nearest playouttime.

HTTP streaming may employ metadata. Presentation level metadataincludes, for example, stream duration, available encodings (bitrates,codecs, spatial resolutions, frame rates, language, media types),pointers to stream metadata for each encoding, and content protection(digital rights management (DRM) information). Stream metadata may beURLs for the segment files.

Segment metadata may include byte range versus time information forrequests within a segment and identification of Random Access Points(RAPs) or other seek points, where some or all of this information maybe part of a segment indexing or segment map.

Streams may comprise multiple encodings of the same content. Eachencoding may then be broken into segments where each segment correspondsto a storage unit or file. In the case of HTTP, a segment is typically aresource that can be referenced by a URL and the request of such URLresults in the return of the segment as the entity body of the requestresponse message. Segments may comprise multiple groups of pictures(GoPs). Each GoP may further comprise multiple fragments where thesegment indexing provides time/byte-offset information for eachfragment, i.e., the unit of indexing is a fragment.

Fragments or portions of fragments may be requested through parallel TCPconnections to increase throughput. This can mitigate problems thatarise when sharing connections on a bottleneck link or when connectionsare lost due to congestion, thus increasing overall speed andreliability of delivery, which can substantially improve the speed andreliability of the content zapping time. Bandwidth can be traded forlatency by over-requesting, but care should be taken to avoid makingrequests too far into the future that can increase the risk ofstarvation.

Multiple requests for segments on the same server may be pipelined(making next request before current request completes) to avoidrepetitious TCP startup delays. Requests for consecutive fragments maybe aggregated into one request.

Some CDNs prefer large files and may trigger background fetches of anentire file from an origin server when first seeing a range request.Most CDNs will, however, serve range requests from cache if the data isavailable. It may therefore be advantageous to have some portion of theclient requests be for a whole segment file. These requests can later becancelled if necessary.

Valid switch points may be seek points, specifically RAPs for example,in the target stream. Different implementations are possible such asfixed GoP structures or alignment of RAPs across streams (based on thebeginning of the media or based on the GoPs).

In one embodiment, segments and GoPs may be aligned across differentrate streams. In this embodiment, GoPs may be of variable size and maycontain multiple fragments, but fragments are not aligned between thedifferent rate streams.

In some embodiments, file redundancy may be employed to advantage. Inthese embodiments, an erasure code is applied to each fragment togenerate redundant versions of the data. Preferably, the sourceformatting is not changed due to the usage of FEC, and additional repairsegments, for example as dependent representation of the originalrepresentation, containing FEC repair data are generated and madeavailable as an additional step in the ingestion system. The client,which is able to reconstruct a fragment using only source data for thatfragment, may only request source data for the fragment within thesegment from the servers. If the servers are unavailable or theconnection to the servers are slow, which can be determined eitherbefore or after the request for source data, additional repair data maybe requested for the fragment from the repair segment, which decreasesthe time to reliably deliver enough data to recover the fragment,possibly using FEC decoding to use a combination of received source andrepair data to recover the source data of the fragment. Furthermore,additional repair data can be requested to allow recovery of thefragment if a fragment becomes urgent, i.e., its playout time becomesimminent, which increases the data share for that fragment on a link butis more efficient than closing other connections on the link to free upbandwidth. This may also mitigate the risk of starvation from the use ofparallel connections.

The fragment format may be a stored stream of real time transportprotocol (RTP) packets with audio/video synchronization achieved throughreal time transport control protocol RTCP.

The segment format may also be a stored stream of MPEG-2 TS packets withaudio/video synchronization achieved MPEG-2 TS internal timing.

Using Signalling and/or Block Creation to Make Streaming More Efficient

A number of features can be used or not, in a block-request streamingsystem, to provide for improved performance. Performance can be relatedto the ability to playout a presentation without stalling, obtainingmedia data within bandwidth constraints, and/or doing so within limitedprocessor resources at a client, server and/or ingestion system. Some ofthese features will now be described.

Indexing within Segments

In order to formulate partial GET requests for Movie Fragments, theclient may be informed of the byte offset and start time in decoding orpresentation time of all media components contained in the fragmentswithin the file or segment and also which fragments begin or contain aRandom Access Points (and so are suitable to be used as switch pointsbetween alternative representations), wherein this information is oftenreferred to as the segment indexing or segment map. The start time indecoding or presentation time may be expressed directly or may beexpressed as deltas relative to a reference time.

This time and byte offset indexing information may require at least 8bytes of data per movie fragment. As an example, for a two hour moviecontained within a single file, with 500 ms movie fragments, this wouldbe a total of about 112 kilobytes of data. Downloading all of this datawhen starting a presentation may result in a significant additionalstartup delay. However, the time and byte offset data can be encodedhierarchically, so that the client can quickly find a small chunk oftime and offset data relevant to the point in the presentation at whichit wishes to start. The information may also be distributed within asegment such that some refinement of the segment index may be locatedinterleaved with media data.

Note that if the a representation is segmented timewise into multiplesegments, the use of this hierarchical coding may not be necessary, asthe complete time and offset data for each segment may already be quitesmall. For example, if segments are one minute instead of two hours inthe above example, the time-byte offset indexing information is around 1kilobyte of data, which can typically fit within a single TCP/IP packet.

Different options are possible to add fragment time and byte offset datato a 3GPP file:

First, the Movie Fragment Random Access Box (“MFRA”) may be used forthis purpose. The MFRA provides a table, which may assist readers infinding random access points in a file using movie fragments. In supportof this function, the MFRA incidentally contains the byte offsets ofMFRA boxes containing random access points. The MFRA may be placed at ornear the end of the file, but this is not necessarily the case. Byscanning from the end of the file for a Movie Fragment Random AccessOffset Box and using the size information in it, one may be able tolocate the beginning of a Movie Fragment Random Access Box. However,placing the MFRA at the end for HTTP streaming requires typically atleast 3-4 HTTP requests to access the desired data: at least one torequest the MFRA from the end of the file, one to obtain the MFRA andfinally one to obtain the desired fragment in the file. Therefore,placing at the beginning may be desirable as then the mfra may bedownloaded together with the first media data in a single request. Also,using the MFRA for HTTP streaming may be inefficient, since none of theinformation in the “MFRA” is needed apart from the time and moof_offsetand specifying offsets instead of lengths may require more bits.

Second, the Item Location Box (“ILOC”) may be used. The “ILOC” providesa directory of metadata resources in this or other files, by locatingtheir containing file, their offset within that file, and their length.For example, a system might integrate all the externally referencedmetadata resources into one file, re-adjusting file offsets and filereferences accordingly. However, the “ILOC” is intended for giving thelocation of metadata so it may be difficult for this to coexist withreal metadata.

Last, and perhaps most suitable, is the specification of a new box,referred to as Time Index Box (“TIDX”), specifically dedicated to thepurpose of providing exact fragment times or durations and byte offsetin an efficient manner. This is described in more detail in the nextsection. An alternative box with the same functionalities may be theSegment Index Box (“SIDX”). Herein, unless otherwise indicated, thesetwo might be interchangeable, as both boxes provide the ability toprovide exact fragment times or durations and byte offset in anefficient manner. The difference between the TIDX and the SIDX areprovided below. It should be apparent how to interchange the TIDX boxesand SIDX boxes, as both boxes implement a segment index.

Segment Indexing

A segment has an identified start time and an identified number ofbytes. Multiple fragments may be concatenated into a single segment andclients may issue requests that identify the specific byte range withinthe segment that correspond to the required fragment or subset of thefragment. For example, when HTTP is used as the request protocol, thenthe HTTP Range header may be used for this purpose. This approachrequires that the client has access to a “segment index” of the segmentthat specifies the position within the segment of the differentfragments. This “segment index” may be provided as part of the metadata.This approach has the result that far fewer files need to be created andmanaged compared to the approach where every block is kept in a separatefile. Management of the creation, transfer and storage of very largenumbers of files (which could extend to many thousands for a 1 hourpresentation, say) can be complex and error-prone and so reduction inthe number of files represents an advantage.

If the client only knows the desired start time of a smaller portion ofa segment, it might request the whole file, then read the file throughto determine the appropriate playout starting location. To improvebandwidth usage, segments can include an index file as metadata, wherethe index file maps the byte ranges of individual blocks with the timeranges that the blocks correspond to, called segment indexing or segmentmap. This metadata can be formatted as XML data or they may be binary,for example following the atom and box structure of the 3GPP fileformat. The indexing can be simple, wherein the time and byte ranges ofeach block are absolute relative to the start of the file, or they canbe hierarchical, wherein some blocks are grouped into parent blocks (andthose into grandparent blocks, etc.) and the time and byte range for agiven block is expressed relative to the time and/or byte range of theblock's parent block.

Example Indexing Map Structure

In one embodiment, the original source data for one representation of amedia stream may be contained in one or more media files herein called a“media segment”, wherein each media segment contains the media data usedto playback a continuous time segment of the media, e.g., 5 minutes ofthe media playback.

FIG. 6 shows an example overall structure of a media segment. Withineach segment, either at the beginning or spread throughout the sourcesegment, there can also be indexing information, which comprises atime/byte-offset segment map. The time/byte-offset segment map in oneembodiment may be a list of time/byte-offset pairs (T(0), B(0)), (T(1),B(1)), (T(i), B(i)), . . . , (T(n), B(n)), wherein T(i−1) represents astart time within the segment for playback of the i-th fragment of mediarelative to initial start time of the media amongst all media segments,T(i) represents an end time for the i-th fragment (and thus the starttime for the next fragment), and the byte-offset B(i−1) is thecorresponding byte index of the beginning of the data within this sourcesegment where the i-th fragment of media starts relative to thebeginning of the source segment, and B(i) is the corresponding end byteindex of the i-th fragment (and thus the index of the first byte of thenext fragment). If the segment contains multiple media components, thenT(i) and B(i) may be provided for each component in the segment in aabsolute way or they may be expressed relative to another mediacomponent that serves a reference media component.

In this embodiment, the number of fragments in the source segment is n,where n may vary from segment to segment.

In another embodiment, the time offset in the segment index for eachfragment may be determined with absolute start time of the firstfragment and the durations of each fragment. In this case, the segmentindex may document the start time of the first fragment and the durationof the all fragments that are included in the segment. The segment indexmay also only document a subset of the fragments. In that case, thesegment index documents the duration of a subsegment that is defined asone or more consecutive fragments, ending either at the end of thecontaining segment, or at the beginning of the next subsegment.

For each fragment, there may also be a value that indicates whether ornot the fragment starts at or contains a seek point, i.e., at a pointwherein no media after that point depends on any media previous to thatpoint, and thus the media from that fragment forward can be played outindependently of previous fragments. Seek points are, in general, pointsin the media where playout can start independently of all previousmedia. FIG. 6 also shows a simple example of possible segment indexingfor a source segment. In that example, the time offset value is in unitsof milliseconds, and thus the first fragment of this source segmentstarts 20 seconds from the beginning of the media, and the firstfragment has a playout time of 485 milliseconds. The byte offset of thestart of the first fragment is 0, and the byte offset of the end of thefirst fragment/start of the second fragment is 50,245, and thus thefirst fragment is of size 50,245 bytes. If the fragment or thesubsegment does not start with a random access point, but the randomaccess point is contained in the fragment or subsegment, then thedecoding time or presentation time difference between the start time andthe actual RAP time may be given. This enables that in case of switchingto this media segment, the client can accurately know the time until theswitch from representation needs to be presented.

In addition to, or instead of, simple or hierarchical indexing,daisy-chained indexing and/or a hybrid indexing could be used.

Because the sample durations for different tracks might not be the same(for example, video samples might be displayed for 33 ms, whereas anaudio sample might last 80 ms), the different tracks in a Movie Fragmentmight not begin and end at precisely the same time, i.e., the audio maybegin slightly before or slightly after the video, with the oppositebeing true of the preceding fragment, to compensate. To avoid ambiguity,the timestamps specified in the time and byte offset data may bespecified relative to a particular track and this may be the same trackfor each representation. Usually this will be the video track. Thisallows the client to identify exactly the next video frame when it isswitching representations.

Care may be taken during presentation to maintain a strict relationshipbetween track timescales and presentation time, to ensure smooth playoutand maintenance of audio/video synchronisation despite the above issue.

FIG. 7 illustrates some examples, such as a simple index 700 and ahierarchical index 702.

Two specific example of a box that contains a segment map are providedbelow, one referred to as time index box (‘TIDX’) and one referred to as(‘SIDX’). The definition follows the box structure according to the ISObase media file format. Other designs for such boxes to define similarsyntax and with the same semantics and functionality should be apparentto the reader.

Time Index Box

Definition

Box Type: ‘tidx’

Container: File

Mandatory: No

Quantity: Any number zero or one

The Time Index Box may provide a set of time and byte offset indicesthat associate certain regions of the file with certain time intervalsof the presentation. The Time Index Box may include a targettype field,which indicates the type of the referenced data. For example, a TimeIndex Box with targettype “moof” provides an index to the MediaFragments contained in the file in terms of both time and byte offsets.A Time Index Box with targettype of Time Index Box can be used toconstruct a hierarchical time index, allowing users of the file toquickly navigate to the required portion of the index.

The segment index may for example contain the following syntax:

  aligned(8) class TimeIndexBox extends FullBox(‘frai’) { unsignedint(32) targettype; unsigned int(32) time_reference_track_ID; unsignedint(32) number_of_elements; unsigned int(64) first_element_offset;  unsigned int(64) first_element_time; for(i=1; i <= number_of_elements;i++)  {  bit (1)   random_access_flag;  unsigned int(31) length; unsigned int(32) deltaT;  } }

Semantics

targettype: is the type of the box data referenced by this Time IndexBox. This can be either Movie Fragment Header (“moof”) or Time Index Box(“tidx”).

time-reference_track_id: indicates the track with respect to which thetime offsets in this index are specified.

number_of_elements: the number of elements indexed by this Time IndexBox.

first_element_offset: The byte offset from the start of the file of thefirst indexed element.

first_element_time: The start time of the first indexed element, usingthe timescale specified in the Media Header box of the track identifiedby the time_reference_track_id.

random_access_flag: One if the start time of the element is a randomaccess point. Zero otherwise.

length: The length of the indexed element in bytes

deltaT: The difference in terms of the timescale specified in the MediaHeader box of the track identified by the time_reference_track_idbetween the start time of this element and the start time of the nextelement.

Segment Index Box

The Segment Index Box (‘sidx’) provides a compact index of the moviefragments and other Segment Index Boxes in a segment. There are two loopstructures in the Segment Index Box. The first loop documents the firstsample of the subsegment, that is, the sample in the first moviefragment referenced by the second loop. The second loop provides anindex of the subsegment. The container for ‘sidx’ box is the file orsegment directly.

Syntax

aligned(8) class SegmentIndexBox extends FullBox(‘sidx’, version, 0) {  unsigned int(32) reference_track_ID;   unsigned int(16) track_count;  unsigned int(16) reference_count;   for (i=1; i<= track_count; i++)  {     unsigned int(32) track_ID;     if (version==0)     {      unsigned int(32) decoding_time;     } else     {       unsignedint(64) decoding_time;     }   }   for(i=1; i <= reference_count; i++)  {     bit (1) reference_type;     unsigned int(31) reference_offset;    unsigned int(32) subsegment_duration;     bit(1) contains_RAP;    unsigned int(31) RAP_delta_time;   } }

Semantics:

reference_track_ID provides the track_ID for the reference track.

track_count: the number of tracks indexed in the following loop (1 orgreater);

reference_count: the number of elements indexed by second loop (1 orgreater);

track_ID: the ID of a track for which a track fragment is included inthe first movie fragment identified by this index; exactly one track_IDin this loop is equal to the reference_track_ID;

decoding_time: the decoding time for the first sample in the trackidentified by track_ID in the movie fragment referenced by the firstitem in the second loop, expressed in the timescale of the track (asdocumented in the timescale field of the Media Header Box of the track);

reference_type: when set to 0, indicates that the reference is to amovie fragment (‘moof’) box; when set to 1, indicates that the referenceis to a segment index (‘sidx’) box;

reference_offset: the distance in bytes from the first byte followingthe containing Segment Index Box, to the first byte of the referencedbox;

subsegment_duration: when the reference is to Segment Index Box, thisfield carries the sum of the subsegment_duration fields in the secondloop of that box; when the reference is to a movie fragment, this fieldcarries the sum of the sample durations of the samples in the referencetrack, in the indicated movie fragment and subsequent movie fragments upto either the first movie fragment documented by the next entry in theloop, or the end of the subsegment, whichever is earlier; the durationis expressed in the timescale of the track (as documented in thetimescale field of the Media Header Box of the track);

contains_RAP: when the reference is to a movie fragment, then this bitmay be 1 if the track fragment within that movie fragment for the trackwith track_ID equal to reference_track_ID contains at least one randomaccess point, otherwise this bit is set to 0; when the reference is to asegment index, then this bit is set to 1 only if any of the referencesin that segment index have this bit set to 1, and 0 otherwise;

RAP_delta_time: if contains_RAP is 1, provides the presentation(composition) time of a random access point (RAP); reserved with thevalue 0 if contains_RAP is 0. The time is expressed as the differencebetween the decoding time of the first sample of the subsegmentdocumented by this entry and the presentation (composition) time of therandom access point, in the track with track_ID equal toreference_track_ID.

Differences Between TIDX and SIDX

The SIDX and the SIDX provide the same functionality with respect toindexing. The first loop of the SIDX provides in addition global timingfor the first movie fragment, but the global timing may as well becontained in the movie fragment itself, either absolute or relative tothe reference track.

The second loop of the SIDX implements the functionality of the TIDX.Specifically, the SIDX permits to have a mixture of targets for thereference for each index referred to by reference_type, whereas the TIDXonly references either only TIDX or only MOOF. The number_of_elements inTIDX corresponds to the reference_count in SIDX, thetime-reference_track_id in TIDX corresponds to reference_track_ID inSIDX, the tfirst_element_offset in TIDX corresponds to thereference_offset in the first entry of the second loop, thefirst_element_time in TIDX corresponds to the decoding_time of thereference_track in the first loop, the random_access_flag in TIDXcorresponds to the contains_RAP in the SIDX with the additional freedomthat in the SIDX the RAP may not necessarily be placed at the start ofthe fragment, and therefore requiring the RAP_delta_time, the length inTIDX corresponds to the reference_offset in SIDX and finally the deltaTin TIDX corresponds to the subsegment_duration in SIDX. Therefore thefunctionalities of the two boxes are equivalent.

Variable Block Sizing and Sub-GoP Blocks

For video media, the relationship between video encoding structure andthe block structure for requests can be important. For example, if eachblock begins with a seek point, such as a Random Access Point (“RAP”),and each block represents an equal period of video time, then thepositioning of at least some seek points in the video media is fixed andseek points will occur at regular intervals within the video encoding.As is well known to those of skill in the art of video encoding,compression efficiency may be improved if seek points are placedaccording to relationships between video frames, and in particular, ifthey are placed at frames that have little in common with previousframes. This requirement that blocks represent equal amounts of timethus places a restriction on the video encoding, such that compressionmay be sub-optimal.

It is desirable to allow the position of seek points within a videopresentation to be chosen by the video encoding system, rather thanrequiring seek points at fixed positions. Allowing the video encodingsystem to choose the seek points results in improved video compressionand thus a higher quality of video media can be provided using a givenavailable bandwidth, resulting in an improved user experience. Currentblock-request streaming systems can require that all blocks be of thesame duration (in video time), and that each block must begin with aseek point and this is thus a disadvantage of existing systems.

A novel block-request streaming system that provides advantages over theabove is now described. In one embodiment, the video encoding process ofa first version of the video component may be configured to choose thepositions of seek points in order to optimize compression efficiency,but with a requirement that there is a maximum on the duration betweenseek points. This latter requirement does restrict the choice of seekpoints by the encoding process and thus reduces compression efficiency.However, the reduction in compression efficiency is small compared tothat incurred if regular fixed positions is required for the seekpoints, provided the maximum on the duration between seek points is nottoo small (for example, greater than around a second). Furthermore, ifthe maximum on the duration between seek points is a few seconds, thenthe reduction in compression efficiency compared to completely freepositioning of seek points is generally very small.

In many embodiments, including this embodiment, it may be that some RAPsare not seek points, i.e., there may be a frame that is a RAP that isbetween two consecutive seek points that is not chosen to be a seekpoint, for example because the RAP is too close in time to thesurrounding seek points, or because the amount of media data between theseek point preceding or following the RAP and the RAP is too small.

The position of seek points within all other versions of the mediapresentation may be constrained to be the same as the seek points in afirst (for example, the highest media data rate) version. This doesreduce the compression efficiency for these other version compared toallowing the encoder free choice of seek points.

The use of seek points typically required a frame to be independentlydecodable, which generally results in a low compression efficiency forthat frame. Frames that are not required to be independently decodablecan be encoded with reference to data in other frames, which generallyincreases compression efficiency for that frame by an amount that isdependent on the amount of commonality between the frame to be encodedand the reference frames. Efficient choice of seek point positioningpreferentially chooses as a seek point frame a frame that has lowcommonality with previous frames and thereby minimizes the compressionefficiency penalty incurred by encoding the frame in a way that isindependently decodable.

However, the level of commonality between a frame and potentialreference frames is highly correlated across different representationsof the content, since the original content is the same. As a result, therestriction of seek points in other variants to be the same positions asthe seek points in the first variant does not make a large difference incompression efficiency.

The seek point structure preferably is used to determined the blockstructure. Preferably, each seek point determined the start of a block,and there may be one or more blocks that encompass the data between twoconsecutive seek points. Since the duration between seek points is notfixed for encoding with good compression, not all blocks are required tohave the same playout duration. In some embodiments, blocks are alignedbetween versions of the content—that is, if there is a block spanning aspecific group of frames in one version of the content, then there is ablock spanning the same group of frames in another version of thecontent. The blocks for a given version of the content do not overlapand every frame of the content is contained within exactly one block ofeach version.

An enabling feature that allows the efficient use of variable durationsbetween seek points, and thus variable duration GoPs, is the segmentindexing or segment map that can be included in a segment or provided byother means to a client, i.e., this is metadata associated with thissegment in this representation that may be provided comprising the starttime and duration of each block of the presentation. The client may usethis segment indexing data when determining the block at which to startthe presentation when the user has requested that the presentation startat a particular point that is within a segment. If such metadata is notprovided, then presentation can begin only at the beginning of thecontent, or at a random or approximate point close to the desired point(for example by choosing the starting block by dividing the requestedstarting point (in time) by the average block duration to give the indexof the starting block).

In one embodiment, each block may be provided as a separate file. Inanother embodiment, multiple consecutive blocks may be aggregated into asingle file to form a segment. In this second embodiment, metadata foreach version may be provided comprising the start time and duration ofeach block and the byte offset within the file at which the blockbegins. This metadata may be provided in response to an initial protocolrequest, i.e., available separately from the segment or file, or may becontained within the same file or segment as the blocks themselves, forexample at the beginning of the file. As will be clear to those of skillin the art, this metadata may be encoded in a compressed form, such asgzip or delta encoding or in binary form, in order to reduce the networkresources required to transport the metadata to the client.

FIG. 6 shows an example of segment indexing where the blocks arevariable size, and where the scope of blocks is a partial GoP, i.e., apartial amount of the media data between one RAP and the next RAP. Inthis example, the seek points are indicated by the RAP indicator,wherein a RAP indicator value of 1 indicates that the block starts withor contains a RAP, or seek point, and wherein a RAP indicator of 0indicates that the block does not contain a RAP or seek point. In thisexample, the first three blocks, i.e., bytes 0 through 157,033, comprisethe first GoP, which has a presentation duration of 1.623 seconds, witha presentation time running from 20 seconds into the content to 21.623seconds. In this example, the first of the three first blocks comprises0.485 seconds of presentation time, and comprises the first 50,245 bytesof the media data in the segment. In this example, blocks 4, 5, and 6comprise the second GoP, blocks 7 and 8 comprise the third GoP, andblocks 9, 10 and 11 comprise the fourth GoP. Note that there may beother RAPs in the media data that are not designated as seek points, andare thus not signaled as RAPs in the segment map.

Referring again to FIG. 6, if the client or receiver wants to access thecontent starting at time offset approximately 22 seconds into the mediapresentation, then the client could first use other information, such asthe MPD described in more detail later, to first determine that therelevant media data is within this segment. The client can download thefirst portion of the segment to obtain the segment indexing, which inthis case is just a few bytes, for example using an HTTP byte rangerequest. Using the segment indexing, the client may determine that thefirst block that it should download is the first block with a timeoffset that is at most 22 seconds and that starts with a RAP, i.e., is aseek point. In this example, although block 5 has a time offset that issmaller than 22 seconds, i.e., its time offset is 21.965 seconds, thesegment indexing indicates that block 5 does not start with a RAP, andthus instead, based on the segment indexing, the client selects todownload block 4, since its start time is at most 22 seconds, i.e, itstime offset is 21.623 seconds, and it starts with a RAP. Thus, based onthe segment indexing, the client will make an HTTP range requeststarting at byte offset 157,034.

If segment indexing were not available then the client might have todownload all previous 157,034 bytes of data before downloading thisdata, leading to a much longer startup time, or channel zapping time,and to wasteful downloading of data that is not useful. Alternatively,if segment indexing were not available, the client might approximatewhere the desired data starts within the segment, but the approximationmight be poor and it may miss the appropriate time and then requires togo backward which again increases the start-up delay.

Generally, each block encompasses a portion of the media data that,together with previous blocks, can be played out by a media player.Thus, the blocking structure and the signaling of the segment indexingblocking structure to the client, either contained within the segment orprovided to the client through other means, can significantly improvethe ability of the client to provide fast channel zapping, and seamlessplayout in the face of network variations and disruptions. The supportof variable duration blocks, and blocks that encompass only portions ofa GoP, as enabled by the segment indexing, can significantly improve thestreaming experience. For example, referring again to FIG. 6 and theexample described above where the client wants to start playout atapproximately 22 seconds into the presentation, the client may request,through one or more requests, the data within block 4, and then feedthis into media player as soon as it is available to start playback.Thus, in this example, the playout begins as soon as the 42,011 bytes ofblock 4 are received at the client, thus enabling a fast channel zappingtime. If instead the client needed to request the entire GoP beforeplayout was to commence, the channel zapping time would be longer, asthis is 144,211 bytes of data.

In other embodiments, RAPs or seek points may also occur in the middleof a block, and there may be data in the segment indexing that indicateswhere that RAP or seek point is within the block or fragment. In otherembodiments, the time offset may be the decode time of the first framewithin the block, instead of the presentation time of the first framewithin the block.

FIGS. 8(a) and (b) illustrate an example of variable block sizing analigned seek point structure across a plurality of versions orrepresentations; FIG. 8(a) illustrates variable block sizing withaligned seek points over a plurality of versions of a media stream,while FIG. 8(b) illustrates variable block sizing with non-aligned seekpoints over a plurality of versions of a media stream.

Time is shown across the top in seconds, and the blocks and seek pointsof the two segments for the two representations are shown from left toright in terms of their timing with respect to this time line, and thusthe length of each block shown is proportional to its playout time andnot proportional to the number of bytes in the block. In this example,the segment indexing for both segments of the two representations wouldhave the same time offsets for the seek points, but potentiallydiffering numbers of blocks or fragments between seek points, anddifferent byte offsets to blocks due to the different amounts of mediadata in each block. In this example, if the client wants to switch fromrepresentation 1 to representation 2 at presentation time approximately23 seconds, then the client could request up through block 1.2 in thesegment for representation 1, and start requesting the segment forrepresentation 2 starting at block 2.2, and thus the switch would occurat the presentation coinciding with seek point 1.2 in representation 1,which is at the same time as seek point 2.2 in representation 2.

As should be clear from the foregoing, the block-request streamingsystem described does not constrain the video encoding to place seekpoints at specific positions within the content and this mitigates oneof the problems of existing systems.

In the embodiments described above it is organized so that the seekpoints for the various representations of the same content presentationare aligned. However, in many cases, it is preferable to relax thisalignment requirement. For example, it is sometimes the case thatencoding tools have been used to generate the representations that donot have the capabilities to generate seek point alignedrepresentations. As another example, the content presentation may beencoded into different representations independently, without no seekpoint alignment between different representations. As another example, arepresentation may contain more seek points as it has lower rates andmore commonly it needs to be switched or it contains seek points tosupport trick modes such fast forward or rewind or fast seeking. Thus,it is desirable to provide methods that make a block-request streamingsystem capable of efficiently and seamlessly dealing with non-alignedseek points across the various representations for a contentpresentation.

In this embodiment, the positions of seek points across representationsmay not align. Blocks are constructed such that a new block starts ateach seek point, and thus there might not be alignment between blocks ofdifferent versions of the presentation. An example of such a non-alignedseek point structure between different representations is shown in FIG.8(b). Time is shown across the top in seconds, and the blocks and seekpoints of the two segments for the two representations are shown fromleft to right in terms of their timing with respect to this time line,and thus the length of each block shown is proportional to its playouttime and not proportional to the number of bytes in the block. In thisexample, the segment indexing for both segments of the tworepresentations would have potentially different time offsets for theseek points, and also potentially differing numbers of blocks orfragments between seek points, and different byte offsets to blocks dueto the different amounts of media data in each block. In this example,if the client wants to switch from representation 1 to representation 2at presentation time approximately 25 seconds, then the client couldrequest up through block 1.3 in the segment for representation 1, andstart requesting the segment for representation 2 starting at block 2.3,and thus the switch would occur at the presentation coinciding with seekpoint 2.3 in representation 2, which is in the middle of the playout ofblock 1.3 in representation 1, and thus some of the media for block 1.2would not be played out (although the media data for the frames of block1.3 that are not played out may have to be loaded into the receiverbuffer for decoding other frames of block 1.3 that are played out).

In this embodiment, the operation of block selector 123 may be modifiedsuch that whenever it is required to select a block from arepresentation that is different from the previously selected version,the latest block whose first frame is not later than the framesubsequent to the last frame of the last selected block is chosen.

This last described embodiment may eliminate the requirement toconstrain the positions of seek points within versions other than thefirst version and thus increases compression efficiency for theseversions resulting in a higher quality presentation for a givenavailable bandwidth and this an improved user experience. A furtherconsideration is that video encoding tools which perform the function ofseek point alignment across multiple encodings (versions) of the contentmay not be widely available and therefore an advantage of this latestdescribed embodiment is that currently available video encoding toolsmay be used. Another advantage is that encoding of different versions ofthe content may proceed in parallel without any need for coordinationbetween encoding processes for the different versions. Another advantageis that additional versions of the content may be encoded and added tothe presentation at a later time, without having to provide the encodingtools with the lists of specific seek point positions.

Generally, where pictures are encoded as groups of pictures (GoPs), thefirst picture in the sequence can be a seek point, but that need notalways be the case.

Optimal Block Partitioning

One issue of concern in a block-request streaming system is theinteraction between the structure of encoded media, for example videomedia, and the block structure used for block requests. As will be knownto those of skill in the art of video encoding, it is often the casethat the number of bits required for the encoded representation of eachvideo frame varies, sometimes substantially, from frame to frame. As aresult the relationship between the amount of received data and theduration of media encoded by that data may not be straightforward.Furthermore, the division of media data into block within ablock-request streaming system adds a further dimension of complexity.In particular, in some systems the media data of a block may not beplayed out until the entire block has been received, for example thearrangement of media data within a block or dependencies between mediasamples within a block of the use of erasure codes may result in thisproperty. As a result of these complex interactions between block sizeand block duration and the possible need to receive an entire blockbefore beginning playout it is common for client systems to adopt aconservative approach wherein media data is buffered before playoutbegins. Such buffering results in a long channel zapping time and thus apoor user experience.

Pakzad describes “block partitioning methods” which are new andefficient methods to determine how to partition a data stream intocontiguous blocks based on the underlying structure of the data streamand further describes several advantages of these methods in the contextof a streaming system. A further embodiment of the invention to applythe block partitioning methods of Pakzad to a block-request streamingsystem is now described. This method may comprise arranging the mediadata to be presented into approximate presentation time order, such thatthe playout time of any given element of media data (for example a videoframe or audio sample) differs from that of any adjacent media dataelement by less than a provided threshold. The media data so ordered maybe considered a data stream in the language of Pakzad and any of themethods of Pakzad applied to this data stream identify block boundarieswith the data stream. The data between any pair of adjacent blockboundaries is considered a “Block” in the language of this disclosureand the methods of this disclosure are applied to provide forpresentation of the media data within a block-request streaming system.As will be clear to those of skill in the art on reading this disclosurethe several advantages of the methods disclosed in Pakzad may then berealized in the context of a block-request streaming system.

As described in Pakzad, the determination of the block structure of asegment, including the blocks that encompass partial GoPs or portions ofmore than on GoP, can impact the ability of the client to enable fastchannel zapping times. In Pakzad, methods were provided that, given atarget startup time, would provide a block structure and a targetdownload rate that would ensure that if the client started downloadingthe representation at any seek point and started playout after thetarget startup time has elapsed then the playout would continueseamlessly as long as at each point in time the amount of data theclient has downloaded is at least the target download rate times theelapsed time from the beginning of the download. It is advantageous forthe client to have access to the target startup time and the targetdownload rate, as this provides the client with a means to determinewhen to start playing out the representation at the earliest point intime, and allows the client to continue to play out the representationas long as the download meets the condition described above. Thus, themethod described later provides a means for including the target startuptime and the target download rate within the Media PresentationDescription, so that it can be used for the purposes described above.

Media Presentation Data Model

FIG. 5 illustrates possible structures of the content store shown inFIG. 1, including segments and media presentation description (“MPD”)files, and a breakdown of segments, timing, and other structure withinan MPD file. Details of possible implementations of MPD structures orfiles will now be described. In many examples, the MPD is described as afile, but non-file structures can be used as well.

As illustrated there, content store 110 holds a plurality of sourcesegments 510, MPDs 500 and repair segments 512. An MPD might compriseperiod records 501, which in turn might comprise representation records502, that contain segment information 503 such as references toinitialization segments 504 and media segments 505.

FIG. 9(a) illustrates an example metadata table 900, while FIG. 9(b)illustrates an example of how an HTTP streaming client 902 obtainsmetadata table 900 and media blocks 904 over a connection to an HTTPstreaming server 906.

In the methods described herein, a “Media Presentation Description” isprovided that comprises information regarding the representations of themedia presentation that are available to the client. Representations maybe alternatives in a sense that the client selects one out the differentalternatives, or they may be complementary in a sense that the clientselects several of the representations, each possibly also from a set ofalternatives, and presents them jointly. The representations mayadvantageously be assigned to groups, with the client programmed orconfigured to understand that, for representations in one group, theyare each alternatives to each other, whereas representations fromdifferent groups are such that more than one representation is to bepresented jointly. In other words, if there are more than onerepresentation in a group, the client picks one representation from thatgroup, one representation from the next group, etc., to form apresentation.

Information describing representations may advantageously includedetails of the applied media codecs including profiles and levels ofthose codecs which are required to decode the representation, videoframe rates, video resolution and data rates. The client receiving theMedia Presentation Description may use this information to determine inadvance whether a representation is suitable for decoding orpresentation. This represents an advantage because if thedifferentiating information would only be contained in the binary dataof the representation it would be necessary to request the binary datafrom all representations and to parse and extract the relevantinformation in order to discover information about its suitability.These multiple requests and the parsing annex extraction of the data maytake some time which would result in a long start up time and thereforea poor user experience.

Additionally, the Media Presentation Description may compriseinformation restricting the client requests based on the time of day.For example for a live service the client may be restricted torequesting parts of the presentation which are close to the “currentbroadcast time”. This represents an advantage since for live broadcastit may be desirable to purge data from the serving infrastructure forcontent that was broadcast more than a provided threshold before thecurrent broadcast time. This may be desirable for the reuse of storageresources within the serving infrastructure. This may also be desirabledepending on the type of service offered, e.g., in some cases apresentation may be made available only live because of a certainsubscription model of receiving client devices, whereas other mediapresentations may be made available live and on-demand, and otherpresentations may be made available only live to a first class of clientdevices, only on-demand to a second class of client devices, and acombination of either live or on-demand to a third class of clientdevices. The methods described in the Media Presentation Data Model(below) allow the client to be informed of such policies so that theclient can avoid making requests and adjusting the offerings to theuser, for data that may not be available in the serving infrastructure.As an alternative, for example, the client may present a notification tothe user that this data is not available.

In a further embodiment of the invention the media segments may becompliant to the ISO Base Media File Format described in ISO/IEC14496-12 or derived specifications (such as the 3GP file formatdescribed in 3GPP Technical Specification 26.244). The Usage of 3GPPFile Format section (above) describes novel enhancements to the ISO BaseMedia File Format permitting efficient use of the data structures ofthis file format within a block-request streaming system. As describedin this reference, information may be provided within the filepermitting fast and efficient mapping between time segments of the mediapresentation and byte ranges within the file. The media data itself maybe structured according to the Movie Fragment construction defined inISO/IEC14496-12. This information providing time and byte offsets may bestructured hierarchically or as a single block of information. Thisinformation may be provided at the start of the file. The provision ofthis information using an efficient encoding as described in the Usageof 3GPP File Format section results in the client being able to retrievethis information quickly, for example using an HTTP partial GETrequests, in the case that the file download protocol used by the blockrequest streaming system is HTTP, which results in a short start up,seek or stream switch time and therefore in an improved user experience.

The representations in a media presentation are synchronized in a globaltimeline to ensure seamless switching across representations, typicallybeing alternatives, and to ensure synchronous presentation of two oremore representations. Therefore, sample timing of contained media inrepresentations within an adaptive HTTP streaming media presentation canbe related to a continuous global timeline across multiple segments.

A block of encoded media containing media of multiple types, for exampleaudio and video, may have different presentation end times for thedifferent types of media. In a block request streaming system, suchmedia blocks may be played out consecutively in such a way that eachmedia type is played continuously and thus media samples of one typefrom one block may be played out before media samples of another type ofthe preceding block, which is referred to herein as “continuous blocksplicing.” As an alternative, such media blocks may be played out insuch a way that the earliest sample of any type of one block is playedafter the latest sample of any type of the preceding block, which isreferred to herein as “discontinuous block splicing.” Continuous blocksplicing may be appropriate when both blocks contain media from the samecontent item and the same representation, encoded in sequence, or inother cases. Typically, within one representation continuous blocksplicing may be applied when splicing two blocks. This is advantageousas existing encoding can be applied and segmentation can be done withoutneeding to align media tracks at block boundaries. This is illustratedin FIG. 10, where video stream 1000 comprises block 1202 and otherblocks, with RAPs such as RAP 1204.

Media Presentation Description

A media presentation may be viewed as a structured collection of fileson an HTTP-Streaming server. The HTTP-Streaming client can downloadsufficient information to present the streaming service to the user.Alternative representations may comprise of one or more 3GP files orparts of 3GP files conforming to the 3GPP file format or at least to awell defined set of data structures that can be easily converted from orto a 3GP file.

A media presentation may be described by a media presentationdescription. The Media Presentation Description (MPD) may containmetadata that the client can use to construct appropriate file requests,for example HTTP GET requests, to access the data at appropriate timeand to provide the streaming service to the user. The media presentationdescription may provide sufficient information for the HTTP streamingclient to select the appropriate 3GPP files and pieces of files. Theunits that are signalled to the client to be accessible are referred toas segments.

Among others, a media presentation description may contain elements andattributes as follows.

MediaPresentationDescription Element

An Element encapsulating metadata used by the HTTP Streaming Client toprovide the streaming service to the end user. TheMediaPresentationDescription Element may contain one or more of thefollowing attributes and elements.

Version: Version number for protocol to ensure extensibility.

PresentationIdentifier: Information such that the presentation may beuniquely identified among other presentations. May also contain privatefields or names

UpdateFrequency: Update frequency of the media presentation description,i.e. how often the client may reload the actual media presentationdescription. If not present, the media presentation may be static.Updating the media presentation may mean that the media presentationcannot be cached.

MediaPresentationDescriptionURI: URI for dating the media presentationdescription.

Stream: Describes the type of the Stream or media presentation: video,audio, or text. A video stream type may contain audio and may containtext.

Service: Describes the service type with additional attributes. Servicetypes may be live and on-demand. This may be used to inform the clientthat seeking and access beyond some current time is not permitted.

MaximumClientPreBufferTime: A maximum amount of time the client maypre-buffer the media stream. This timing may differentiate streamingfrom progressive download if the client is restricted to download beyondthis maximum pre-buffer time. The value may not be present indicatingthat no restrictions in terms of pre-buffering may apply.

SafetyGuardIntervalLiveService: Information on the maximum turn-aroundtime of a live service at the server. Provides an indication to theclient what of information already accessible at the current time. Thisinformation may be necessary if the client and the server are expectedto operate on UTC time and no tight time synchronization is provided.

TimeShiftBufferDepth: Information on how far back the client may move ina live service relative to the current time. By the extension of thisdepth, time-shift viewing and catch-up services may be permitted withoutspecific changes in service provisioning.

LocalCachingPermitted: This flag indicates if the HTTP Client can cachethe downloaded data locally after it has been played.

LivePresentationInterval: Contains time intervals during which thepresentation may be available by specifying StartTimes and EndTimes. TheStartTime indicates the start time of the services and the EndTimeindicates the end-time of the service. If the EndTime is not specified,then the end time is unknown at current time and the UpdateFrequency mayensure that the clients gets access to the end-time before the actualend-time of the service.

OnDemandAvailabilityInterval: The presentation interval indicates theavailability of the service on the network. Multiple presentationintervals may be provided. The HTTP Client may not be able to access theservice outside any specified time window. By the provisioning of theOnDemand Interval, additional time-shift viewing may be specified. Thisattribute may also be present for a live service. In case it is presentfor a live service, the server may ensure that the client can access theservice as OnDemand Service during all provided availability intervals.Therefore, the LivePresentationInterval may not overlap with anyOnDemandAvailabilityInterval.

MPDFileInfoDynamic: Describes the default dynamic construction of filesin the media presentation. More details are provided below. The defaultspecification on MPD level may save unnecessary repetition if the samerules for several or all alternative representations are used.

MPDCodecDescription: Describes the main default codecs in the mediapresentation. More details are provided below. The default specificationon MPD level may save unnecessary repetition if the same codecs forseveral or all representations are used.

MPDMoveBoxHeaderSizeDoesNotChange: A flag to indicate if the MoveBoxHeader changes in size among the individual files within the entiremedia presentation. This flag can be used to optimize the download andmay only be present in case of specific segment formats, especiallythose for which segments contain the moov header.

FileURIPattern: A pattern used by the Client to generate Requestmessages for files within the media presentation. The differentattributes permit generation of unique URIs for each of the files withinthe media presentation. The base URI may be an HTTP URI.

Alternative Representation: Describes a list of representations.

AlternativeRepresentation Element:

An XML Element that encapsulates all metadata for one representation.The AlternativeRepresentation Element may contain the followingattributes and elements.

RepresentationID: A unique ID for this specific AlternativeRepresentation within the media presentation.

FilesInfoStatic: Provides an explicit list of the starting times and theURI of all files of one alternative presentation. The staticprovisioning of the list of files may provide the advantage of an exacttiming description of the media presentation, but it may not be ascompact, especially if the alternative representation contains manyfiles. Also, the file names may have arbitrary names.

FilesInfoDynamic: Provides an implicit way to construct the list of thestarting times and the URI of one alternative presentation. The dynamicprovisioning of the list of files may provide the advantage of a morecompact representation. If only the sequence of starting times areprovided, then the timing advantages also hold here, but the file namesare to be constructed dynamically based in the FilePatternURI. If onlythe duration of each segment is provided then the representation iscompact and may be suited for use within live services, but thegeneration of the files may be governed by global timing.

APMoveBoxHeaderSizeDoesNotChange: A flag that indicates if the MoveBoxHeader changes in size among the individual files within the AlternativeDescription. This flag can be used to optimize the download and may onlybe present in case of specific segment formats, especially those forwhich segments contain the moov header.

APCodecDescription: Describes the main codecs of files in thealternative presentation.

Media Description Element

MediaDescription: An element that may encapsulate all metadata for themedia that is contained in this representation. Specifically it maycontain information about the tracks in this alternative presentation aswell as recommended grouping of tracks, if applicable. TheMediaDescription Attribute contains the following attributes:

TrackDescription: An XML attribute that encapsulates all metadata forthe media that is contained in this representation. The TrackDescriptionAttribute contains the following attributes:

TrackID: A unique ID for the track within the alternativerepresentation. This may be used in case the track is part of a groupingdescription.

Bitrate: The bitrate of the track.

TrackCodecDescription: An XML attribute that contains all attributes onthe codec used in this track. The TrackCodecDescription Attributecontains the following attributes:

MediaName: An attribute defining the media type. The media types include“audio”, “video”, “text”, “application”, and “message”.

Codec: CodecType including profile and level.

LanguageTag: LanguageTag if applicable.

MaxWidth, MaxHeight: For video, Height and Width of contained video inpixel.

SamplingRate: For audio, sampling rate

GroupDescription: An attribute that provides recommendation to theclient for appropriate grouping based on different parameters.

GroupType: A type based on which the client may decide how to grouptracks.

The information in a media presentation description is advantageouslyused by an HTTP streaming client to perform requests for files/segmentsor parts thereof at appropriate times, selecting the segments fromadequate representations that match its capabilities, for example interms of access bandwidth, display capabilities, codec capabilities, andso on as well as preferences of the user such as language, and so on.Furthermore, as the Media Presentation description describesrepresentations that are time-aligned and mapped to a global timeline,the client may also use the information in the MPD during an ongoingmedia presentation for initiating appropriate actions to switch acrossrepresentations, to present representations jointly or to seek withinthe media presentation.

Signalling Segment Start Times

A representation may be split, timewise, into multiple segments. Aninter-track timing issue exists between the last fragment of one segmentand the next fragment of the next segment. In addition, another timingissue exists in the case that segments of constant duration are used.

Using the same duration for every segment may have the advantage thatthe MPD is both compact and static. However, every segment may stillbegin at a Random Access Point. Thus, either the video encoding may beconstrained to provide Random Access Points at these specific points, orthe actual segment durations may not be precisely as specified in theMPD. It may be desirable that the streaming system does not placeunnecessary restrictions on the video encoding process and so the secondoption may be preferred.

Specifically, if the file duration is specified in the MPD as d seconds,then the n-th file may begin with the Random Access Point at orimmediately following time (n−1)d.

In this approach, each file may include information as to the exactstart time of the segment in terms of global presentation time. Threepossible ways to signal this include:

(1) First, restrict the start time of each segment to the exact timingas specified in the MPD. But then the media encoder may not have anyflexibility on the placement of the IDR frames and may require specialencoding for file streaming

(2) Second, add the exact start time to the MPD for each segment. Forthe on-demand case, the compactness of MPD may be reduced. For the livecase, this may require a regular update of the MPD, which may reducescalability.

(3) Third, add the global time or the exact start time relative to theannounced start time of the representation or the announced start timeof the segment in the MPD to the segment in a sense that the segmentcontains this information. This might be added to a new box dedicated toadaptive streaming. This box may also include the information asprovided by the “TIDX” or “SIDX” box. A consequence of this thirdapproach is that when seeking to a particular position near thebeginning of one of the segments the client may, based on the MPD,choose the subsequent segment to the one containing the required seekpoint. A simple response in this case may be to move the seek pointforward to the start of the retrieved segment (i.e., to the next RandomAccess Point after the seek point). Usually, Random Access Points areprovided at least every few seconds (and often there is little encodinggain from making them less frequent) and so in the worst case the seekpoint may be moved to be a few seconds later than specified.Alternatively, the client could determine in retrieving the headerinformation for the segment that the requested seek point is in fact inthe previous segment and request that segment instead. This may resultin an occasional increase in the time required to execute the seekoperation.

Accessible Segments List

The media presentation comprises a set of representations each providingsome different version of encoding for the original media content. Therepresentations themselves advantageously contain information on thedifferentiating parameters of the representation compared to otherparameters. They also contain, either explicitly or implicitly, a listof accessible segments.

Segments may be differentiated in time-less segments containing metadataonly and media segments that primarily contain media data. The MediaPresentation Description (“MPD”) advantageously identifies and assignsdifferent attributes to each of the segments, either implicitly orexplicitly. Attributes advantageously assigned to each segment comprisethe period during which a segment is accessible, the resources andprotocols through which the segments are accessible. In addition, mediasegments are advantageously assigned attributes such as the start timeof the segment in the media presentation, and the duration of thesegment in the media presentation.

Where the media presentation is of type “on-demand”, as advantageouslyindicated by an attribute in the media presentation description such asthe OnDemandAvailabilityInterval, then the media presentationdescription typically describes the entire segments and also providesindication when the segments are accessible and when the segments arenot accessible. The start times of segments are advantageously expressedrelative to the start of the media presentation such that two clientsstarting the play-back of the same media presentations, but at differenttimes, can use the same media presentation description as well as thesame media segments. This advantageously improves the ability to cachethe segments.

Where the media presentation is of type “live”, as advantageouslyindicated by an attribute in the media presentation description such asthe attribute Service, then the segments comprising the mediapresentation beyond the actual time of day are generally not generatedor at least not accessible despite the segments are fully described inthe MPD. However, with the indication that the media presentationservice is of type “live”, the client may produce a list of accessiblesegments along with the timing attributes for a client internal time NOWin wall-clock time based on the information contained in the MPD and thedownload time of the MPD. The server advantageously operates in a sensethat it makes resource accessible such that a reference client operatingwith the instance of the MPD at wall-clock time NOW can access theresources.

Specifically, the reference client produces a list of accessiblesegments along with the timing attributes for a client internal time NOWin wall-clock time based on the information contained in the MPD and thedownload time of the MPD. With time advancing, the client will use thesame MPD and will create a new accessible segment list that can be usedto continuously playout the media presentation. Therefore, the servercan announce segments in an MPD before these segments are actuallyaccessible. This is advantageous, as it reduces frequent updating anddownloading of the MPD.

Assume that a list of segments, each with start time, tS, is describedeither explicitly by a play list in elements such as FileInfoStatic orimplicitly by using an element such as FileInfoDynamic. An advantageousmethod to generate a segment list using FileInfoDynamic is describedbelow. Based on this construction rule, the client has access to a listof URIs for each representation, r, referred to herein as FileURI(r,i),and a start time tS(r,i) for each segment with index i.

The use of information in the MPD to create the accessible time windowof segments may be performed using the following rules.

For a service of type “on-demand”, as advantageously indicated by anattribute such as Service, if the current wall-clock time at the clientNOW is within any range of the availability, advantageously expressed byan MPD element such as OnDemandAvailabilityInterval, then all describedsegments of this On-Demand presentation are accessible. If the currentwall-clock time at the client NOW is outside any range of theavailability, then none of the described segments of this On-Demandpresentation are accessible.

For a service of type “live”, as advantageously indicated by anattribute such as Service, the start time tS(r,i) advantageouslyexpresses the time of availability in wall-clock time. The availabilitystart time may be derived as a combination of the live service time ofthe event and some turn-around time at the server for capturing,encoding, and publishing. The time for this process may, for example, bespecified in the MPD, for example using a safety guard interval tGspecified for example specified as SafetyGuardIntervalLiveService in theMPD. This would provide the minimum difference between UTC time and theavailability of the data on the HTTP streaming server. In anotherembodiment, the MPD explicitly specifies the availability time of thesegment in the MPD without providing the turn-around time as adifference between the event live time and the turn-around time. In thefollowing descriptions, it is assumed that any global times arespecified as availability times. One or ordinary skill in art of livemedia broadcasting can derive this information from suitable informationin the media presentation description after reading this description.

If the current wall-clock time at the client NOW is outside any range ofthe live presentation interval, advantageously expressed by an MPDelement such as LivePresentationInterval, then none of the describedsegments of this live presentation are accessible. If the currentwall-clock time at the client NOW is within the live presentationinterval then at least certain segments of the described segments ofthis live presentation may be accessible.

The restriction of the accessible segments is governed by the followingvalues:

The wall-clock time NOW (as available to the client).

The permitted time-shift buffer depth tTSB for example specified asTimeShiftBufferDepth in the media presentation description.

A client at relative event time t₁ may only be allowed to requestsegments with start times tS(r, i) in the interval of (NOW−tTSB) and NOWor in an interval such that the end time of the segment with duration dis also included resulting in an interval of (NOW−tTSB−d) and NOW.

Updating the MPD

In some embodiments, the server does not know in advance the file orsegment locator and start times of the segments as for example theserver location will change, or the media presentation includes someadvertisement from a different server, or the duration of the mediapresentation is unknown, or the server wants to obfuscate the locatorfor the following segments.

In such embodiments, the server might only describe segments that arealready accessible or get accessible shortly after this instance of theMPD has been published. Furthermore, in some embodiments, the clientadvantageously consumes media close to the media described in the MPDsuch that the user experiences the contained media program as close aspossible to the generation of the media content. As soon as the clientanticipates that it reaches the end of the described media segments inthe MPD, it advantageously requests a new instance of the MPD tocontinue continuous play-out in the expectation that the server haspublished a new MPD describing new media segments. The serveradvantageously generates new instances of the MPD and updates the MPDsuch that clients can rely on the procedures for continuous updates. Theserver may adapt its MPD update procedures along with the segmentgeneration and publishing to the procedures of a reference client thatacts as a common client may act.

If a new instance of the MPD only describes a short time advance, thenthe clients need to frequently request new instances of MPD. This mayresult in scalability problems and unnecessary uplink and downlinktraffic due to unnecessary frequent requests.

Therefore, it is relevant on the one hand to describe segments as far aspossible into the future without necessarily making them accessible yet,and on the other hand to enable unforeseen updates in the MPD to expressnew server locations, permit insertion of new content such asadvertisements or to provide changes in codec parameters.

Furthermore, in some embodiments, the duration of the media segments maybe small, such as in the range of several seconds. The duration of mediasegments is advantageously flexible to adjust to suitable segment sizesthat can be optimized to delivery or caching properties, to compensatefor end-to-end delay in live services or other aspects that deal withstorage or delivery of segments, or for other reasons. Especially incases where the segments are small compared to the media presentationduration, then a significant amount of media segment resources and starttimes need to be described in the media presentation description. As aresult, the size of the media presentation description may be largewhich may adversely affect the download time of the media presentationdescription and therefore affect the start-up delay of the mediapresentation and also the bandwidth usage on the access link. Therefore,it is advantageous to not only permit the description of a list of mediasegments using playlists, but also permit the description by usingtemplates or URL construction rules. Templates and URL constructionrules are used synonymously in this description.

In addition, templates may advantageously be used to describe segmentlocators in live cases beyond the current time. In such cases, updatesof the MPD are per se unnecessary as the locators as well as the segmentlist are described by the templates. However, unforeseen events maystill happen that require changes in the description of therepresentations or the segments. Changes in an adaptive HTTP streamingmedia presentation description may be needed when content from multipledifferent sources is spliced together, for example, when advertising hasbeen inserted. The content from different sources may differ in avariety of ways. Another reason, during live presentations, is that itmay be necessary to change the URLs used for content files to providefor fail-over from one live origin server to another.

In some embodiments, it is advantageous that if the MPD is updated, thenthe updates to the MPD are carried out such that the updated MPD iscompatible with the previous MPD in the following sense that thereference client and therefore any implemented client generates anidentically functional list of accessible segments from the updated MPDfor any time up to the validity time of the previous MPD as it wouldhave done from the previous instance of the MPD. This requirementensures that (a) clients may immediately begin using the new MPD withoutsynchronisation with the old MPD, since it is compatible with the oldMPD before the update time; and (b) the update time need not besynchronised with the time at which the actual change to the MPD takesplace. In other words, updates to the MPD can be advertised in advanceand the server can replace the old instance of the MPD once newinformation is available without having to maintain different versionsof the MPD.

Two possibilities may exist for media timing across an MPD update for aset of representations or all representations. Either (a) the existingglobal timeline continues across the MPD update (referred to herein as a“continuous MPD update”), or (b) the current timeline ends and a newtimeline begins with the segment following the change (referred toherein as a “discontinuous MPD update”).

The difference between these options may be evident when consideringthat the tracks of a Media Fragment, and hence of a Segment, generallydo not begin and end at the same time because of the differing samplegranularity across tracks. During normal presentation, samples of onetrack of a fragment may be rendered before some samples of another trackof the previous fragment i.e. there is some kind of overlap betweenfragments although there is may not be overlap within a single track.

The difference between (a) and (b) is whether such overlap may beenabled across an MPD update. When the MPD update is because of splicingof completely separate content, such overlap is generally difficult toachieve as the new content needs new encoding to be spliced with theprevious content. It is therefore advantageous to provide the abilityfor discontinuously updating the media presentation by restarting thetimeline for certain segments and possibly also define a new set ofrepresentations after the update. Also, if the content has beenindependently encoded and segmented, then it is also avoided to adjusttimestamps to fit within the global timeline of the previous piece ofcontent.

When the update is for lesser reasons such as only adding new mediasegments to list of described media segments, or if the location of theURLs is changed then overlap and continuous updates may be allowed.

In the case of a discontinuous MPD update, the timeline of the lastsegment of the previous representation ends at the latest presentationend time of any sample in the segment. The timeline of the nextrepresentation (or, more accurately, the first presentation time of thefirst media segment of the new part of the media presentation, alsoreferred to as new period) typically and advantageously begins at thissame instant as the end of the presentation of the last period such thatseamless and continuous playout is ensured.

The two cases are illustrated in the FIG. 11.

It is preferred and advantageous to restrict MPD updates to segmentboundaries. The rationale for restricting such changes or updates tosegment boundaries is as follows. First, changes to the binary metadatafor each representation, typically the Movie Header, may take place atleast at segment boundaries. Second, the Media Presentation Descriptionmay contain the pointers (URLs) to the segments. In a sense the MPD isthe “umbrella” data structure grouping together all the segment filesassociated with the media presentation. To maintain this containmentrelationship, each segment may be referenced by a single MPD and whenthe MPD is updated, it advantageously only updated at a segmentboundary.

Segment boundaries are not generally required to be aligned, however forthe case of content spliced from different sources, and fordiscontinuous MPD updates generally, it makes sense to align the segmentboundaries (specifically, that the last segment of each representationmay end at the same video frame and may not contain audio samples with apresentation start time later than the presentation time of that frame).A discontinuous update may then start a new set of representations at acommon time instant, referred to as period. The start time of thevalidity of this new set of representations is provided, for example bya period start time. The relative start time of each representation isreset to zero and the start time of the period places the set ofrepresentations in this new period in the global media presentationtimeline.

For continuous MPD updates, segment boundaries are not required to bealigned. Each segment of each alternative representation may be governedby a single Media Presentation Description and thus the update requestsfor a new instances of the Media Presentation Description, generallytriggered by the anticipation that no additional media segments aredescribed in the operating MPD, may take place at different timesdepending on the consumed set of representations including the set ofrepresentations that are anticipated to be consumed.

To support updates in MPD elements and attributes in a more generalcase, any elements not only representations or set of representationsmay be associated with a validity time. So, if certain elements of theMDP need to be updated, for example where the number of representationsis changed or the URL construction rules are changed, then theseelements may each be updated individually at specified times, byproviding multiple copies of the element with disjoint validity times.

Validity is advantageously associated with the global media time, suchthat the described element associated with a validity time is valid in aperiod of the global timeline of the media presentation.

As discussed above, in one embodiment, the validity times are only addedto a full set of representations. Each full set then forms a period. Thevalidity time then forms the start time of the period. In other words,in a specific case of the using the validity element, a full set ofrepresentations may be valid for a period in time, indicated by a globalvalidity time for a set of representations. The validity time of a setof representations is referred to as a period. At the start of a newperiod, the validity of the previous set representation is expired andthe new set of representations is valid. Note again that the validitytimes of periods are preferably disjoint.

As noted above, changes to the Media Presentation Description take placeat segment boundaries, and so for each representation, the change anelement actually takes place at the next segment boundary. The clientmay then form a valid MPD including a list of segments for each instantof time within the presentation time of the media.

Discontinuous block splicing may be appropriate in cases where theblocks contain media data from different representations, or fromdifferent content, for example from a segment of content and anadvertisement, or in other cases. It may be required in a block requeststreaming system that changes to presentation metadata take place onlyat block boundaries. This may be advantageous for implementation reasonsbecause updating media decoder parameters within a block may be morecomplex than updating them only between blocks. In this case, it mayadvantageously be specified that validity intervals as described abovemay be interpreted as approximate, such that an element is consideredvalid from the first block boundary not earlier than the start of thespecified validity interval to the first block boundary not earlier thanthe end of the specified validity interval.

An example embodiment of the above describes novel enhancements to ablock-request streaming system is described in the later presentedsection titled Changes to Media Presentations.

Segment Duration Signalling

Discontinuous updates effectively divide the presentation into a seriesof disjoint intervals, referred to as period. Each period has its owntimeline for media sample timing. The media timing of representationwithin a period may advantageously be indicated by specifying a separatecompact list of segment durations for each period or for eachrepresentation in a period.

An attribute, for example referred to as period start time, associatedto elements within the MPD may specify the validity time of certainelements within the media presentation time. This attribute may be addedto any elements (attributes that may get assigned a validity may bechanged to elements) of the MPD.

For discontinuous MPD updates the segments of all representations mayend at the discontinuity. This generally implies at least that the lastsegment before the discontinuity has a different duration from theprevious ones. Signalling segment duration may involve indicating eitherthat all segments have the same duration or indicating a separateduration for every segment. It may be desirable to have a compactrepresentation for a list of segment durations which is efficient in thecase that many of them have the same duration.

Durations of each segment in one representation or a set ofrepresentations may advantageously be carried out with a single stringthat specifies all segment durations for a single interval from thestart of the discontinuous update, i.e., the start of the period untilthe last media segment described in the MPD. In one embodiment, theformat of this element is a text string conforming to a production thatcontains a list of segment duration entries where each entry contains aduration attribute dur and an optional multiplier mult of the attributeindicating that this representation contains <mult> of the first entrysegments of duration <dur> of the first entry, then <mult> of the secondentry segments of duration <dur> of the second entry and so on.

Each duration entry specifies the duration of one or more segments. Ifthe <dur> value is followed by the “*” character and a number, then thisnumber specifies the number of consecutive segments with this duration,in seconds. If the multiplier sign “*” is absent, the number of segmentsis one. If the “*” is present with no following number, then allsubsequent segments have the specified duration and there may be nofurther entries in the list. For example, the string “30*” means allsegments have a duration of 30 seconds. The string “30*12 10.5”indicates 12 segments of duration 30 seconds, followed by one ofduration 10.5 seconds.

If segment durations are specified separately for each alternativerepresentation, then the sum of segment durations within each intervalmay be the same for each representation. In the case of video tracks,the interval may end on the same frame in each alternativerepresentation.

Those of ordinary skill in the art, upon reading this disclosure, mayfind similar and equivalent ways to express segment durations in acompact manner

In another embodiment, the duration of a segment is signalled to beconstant for all segments in the representation except for the last oneby a signal duration attribute <duration>. The duration of the lastsegment before a discontinuous update may be shorter as long as thestart point of the next discontinuous update or the start of a newperiod is provided, which then implies the duration of the last segmentreaching up to the start of the next period.

Changes and Updates to Representation Metadata

Indicating changes of binary coded representation metadata such as movieheader “moov” changes may be accomplished in different ways: (a) theremay be one moov box for all representation in a separate file referencedin the MPD, (b) there may be one moov box for each alternativerepresentation in a separate file referenced in each AlternativeRepresentation, (c) each segment may contain a moov box and is thereforeself-contained, (d) there may be a moov Box for all representation inone 3GP file together with MPD.

Note that in case of (a) and (b), the single ‘moov’ may beadvantageously combined with the validity concept from above in a sensethat more ‘moov’ boxes may be referenced in an MPD as long as theirvalidity is disjoint. For example, with the definition of a periodboundary, the validity of the ‘moov’ in the old period may expire withthe start of the new period.

In case of option (a), the reference to the single moov box may beassigned a validity element. Multiple Presentation headers may beallowed, but only one may be valid at a time. In another embodiment, thevalidity time of the entire set of representations in a period or theentire period as defined above may be used as a validity time for thisrepresentation metadata, typically provided as the moov header.

In case of option (b), the reference to the moov box of eachrepresentation may be assigned a validity element. MultipleRepresentation headers may be allowed, but only one may be valid at atime. In another embodiment, the validity time of the entirerepresentation or the entire period as defined above may be used as avalidity time for this representation metadata, typically provided asthe moov header.

In case of options (c), no signalling in the MPD may be added, butadditional signalling in the media stream may be added to to indicate ifthe moov box will change for any of the upcoming segments. This isfurther explained in the below in the context of “Signaling UpdatesWithin Segment Metadata”.

Signaling Updates within Segment Metadata

To avoid frequent updates of the media presentation description to getknowledge on potential updates, it is advantageous to signal any suchupdates along with the media segments. There may be provided anadditional element or elements within the media segments themselveswhich may indicate that updated metadata such as the media presentationdescription is available and has to be accessed to within a certainamount of time to successfully continue creation of accessible segmentlists. In addition, such elements may provide a file identifier, such asa URL, or information that may be used to construct a file identifier,for the updated metadata file. The updated metadata file may includemetadata equal to that provided in the original metadata file for thepresentation modified to indicate validity intervals together withadditional metadata also accompanied by validity intervals. Such anindication may be provided in media segments of all the availablerepresentations for a media presentation. A client accessing a blockrequest streaming system, on detecting such an indication within a mediablock, may use the file download protocol or other means to retrieve theupdated metadata file. The client is thereby provided with informationabout changes in the media presentation description and the time atwhich they will occur or have occurred. Advantageously, each clientrequests the updated media presentation description only once when sucha changes occur rather than “polling” and receiving the file many timesfor possible updates or changes.

Examples of changes include addition or removal of representations,changes to one or more representation such as change in bit-rate,resolution, aspect ratio, included tracks or codec parameters, andchanges to URL construction rules, for example a different origin serverfor an advertisement. Some changes may affect only the initializationsegment such as the Movie Header (“moov”) atom associated with arepresentation, whereas other changes may affect the Media PresentationDescription (MPD).

In the case of on-demand content, these changes and their timing may beknown in advance and could be signalled in the Media PresentationDescription.

For live content, changes may not be known until the point at which theyoccur. One solution is to allow the Media Presentation Descriptionavailable at a specific URL to be dynamically updated and to requireclients to regularly request this MPD in order to detect changes. Thissolution has disadvantage in terms of scalability (origin server loadand cache efficiency). In a scenario with large numbers of viewers,caches may receive many requests for the MPD after the previous versionhas expired from cache and before the new version has been received andall of these may be forwarded to the origin server. The origin servermay need to constantly process requests from caches for each updatedversion of the MPD. Also, the updates may not easily be time-alignedwith changes in the media presentation.

Since one of the advantages of HTTP Streaming is the ability to utilisestandard web infrastructure and services for scalability, a preferredsolution may involve only “static” (i.e. cachable) files and not rely onclients “polling” files to see if they have changed.

Solutions are discussed and proposed to resolve the update of metadataincluding the media presentation description and binary representationmetadata such as “moov” atoms in an Adaptive HTTP Streaming mediapresentation.

For the case of live content, the points at which the MPD or “moov” maychange might not be known when the MPD is constructed. As frequent“polling” of the MPD to check for updates should generally be avoided,for bandwidth and scalability reasons, updates to the MPD may beindicated “in band” in the segment files themselves, i.e., each mediasegment may have the option to indicate updates. Depending on thesegment formats (a) to (c) from above, different updating may besignalled.

Generally, the following indication may advantageously be provided in asignal within the segment: an indicator that the MPD may be updatedbefore requesting the next segment within this representation or anynext segment that has start time greater than the start time of thecurrent segment. The update may be announced in advance indicating thatthe update need only to happen at any segment later than the next one.This MPD update may also be used to update binary representationmetadata such as Movie Headers in case the locator of the media segmentis changed. Another signal may indicate that with the completion of thissegment, no more segments that advance time should be requested.

In case segments are formatted according to the segment format (c),i.e., each media segment may contain self-initialising metadata such asthe movie header, then yet another signal may be added indicating thatthe subsequent segment contains an updated Movie Header (moov). Thisadvantageously allows the movie header to be included in the segment,but the Movie Header need only be requested by the client if theprevious segment indicates a Movie Header Update or in the case ofseeking or random access when switching representations. In other cases,the client may issue a byte range request to the segment that excludesthe movie header from the download, therefore advantageously savingbandwidth.

In yet another embodiment, if the MPD Update indication is signalled,then the signal may also contain a locator such as URL for the updatedMedia Presentation Description. The updated MPD may describe thepresentation both before and after the update, using the validityattributes such as a new and old period in case of discontinuousupdates. This may advantageously be used to permit time-shift viewing asdescribed further below but also advantageously allows the MPD update tobe signalled at any time before the changes it contains take effect. Theclient may immediately download the new MPD and apply it to the ongoingpresentation.

In a specific realization, the signalling of the any changes to themedia presentation description, the moov headers or the end ofpresentation may be contained in a streaming information box that isformatted following the rules of the segment format using the boxstructure of the ISO base media file format. This box may provide aspecific signal for any of the different updates.

Streaming Information Box

Definition

Box Type: ‘sinf’

Container: None

Mandatory: No

Quantity: Zero or one.

The Streaming Information Box contains information about the streamingpresentation of which the file is a part.

Syntax

  aligned(8) class StreamingInformationBox   extends FullBox(‘sinf’) {unsigned int(32) streaming_information_flags;   /// The following areoptional fields  string mpd_location }

Semantics

streaming_information_flags contains the logical OR of zero or more ofthe following:

-   -   0x00000001 Movie Header update follows    -   0x00000002 Presentation Description update    -   0x00000004 End-of-presentation

mpd_location is present if and only if the Presentation Descriptionupdate flags is set and provides a Uniform Resource Locator for the newMedia Presentation Description.

Example Use Case for MPD Updates for Live Services

Suppose a service provider wants to provide a live football event usingthe enhanced block-request streaming described herein. Perhaps millionsof users might want to access the presentation of the event. The liveevent is sporadically interrupted by breaks when a time out is called,or other lull in the action, during which advertisements might be added.Typically, there is no or little advance notice of the exact timing ofthe breaks.

The service provider might need to provider redundant infrastructure(e.g., encoders and servers) to enable a seamless switch-over in caseany of the components fail during the live event.

Suppose a user, Anna, accesses the service on a bus with her mobiledevice, and the service is available immediately. Next to her sitsanother user, Paul, who watches the event on his laptop. A goal isscored and both celebrate this event at the same time. Paul tells Annathat the first goal in the game was even more exciting and Anna uses theservice so that she can view the event 30 minutes back in time. Afterhaving seen the goal, she goes back to the live event.

To address that use case, the service provider should be able to updatethe MPD, signal to the clients that an updated MPD is available, andpermit clients to access the streaming service such that it can presentthe data close to real-time.

Updating of the MPD is feasible in an asynchronous manner to thedelivery of segments, as explained herein elsewhere. The server canprovide guarantees to the receiver that an MPD is not updated for sometime. The server may rely on the current MPD. However, no explicitsignaling is needed when the MPD is updated before the some minimumupdate period.

Completely synchronous playout is hardly achieved as client may operateon different MPD update instances and therefore, clients may have drift.Using MPD updates, the server can convey changes and the clients can bealerted to changes, even during a presentation. In-band signaling on asegment-by-segment basis can be used to indicate the update of the MPD,so updates might be limited to segment boundaries, but that should beacceptable in most applications.

An MPD element can be added that provides the publishing time inwall-clock time of the MPD as well as an optional MPD update box that isadded at the beginning of segments to signal that an MPD update isrequired. The updates can be done hierarchically, as with the MPDs.

The MPD “Publish time” provides a unique identifier for the MPD and whenthe MPD was issued. It also provides an anchor for the updateprocedures.

The MPD update box might be found in the MPD after the “styp” box, anddefined by a Box Type=“mupe”, needing no container, not being mandatoryand having a quantity of zero or one. The MPD update box containsinformation about the media presentation of which the segment is a part.

Example syntax is as follows:

aligned(8) class MPDUpdateBox   extends FullBox(‘mupe’) {   unsignedint(3) mpd information flags;   unsigned int(l) new-location flag;  unsigned int(28) latest_mpd_update time;   /// The following areoptional fields   string mpd_location }

The semantics of the various objects of the class MPDUpdateBox might beas follows:

-   -   mpd_information_flags: the logical OR of zero or more of the        following:        -   0x00 Media Presentation Description update now        -   0x01 Media Presentation Description update ahead        -   0x02 End-of-presentation        -   0x03-0x07 Reserved    -   new_location flag: if set to 1, then the new Media Presentation        Description is available at a new location specified in        mpd_location.    -   latest_mpd_update time: specifies the time (in ms) by when the        MPD update is necessary relative to the MPD issue time of the        latest MPD. The client may choose to update the MPD any time        between now.    -   mpd_location: is present if and only if the new_location_flag is        set and if so, mpd_location provides a Uniform Resource Locator        for the new Media Presentation Description.

If the bandwidth used by updates is an issue, the server may offer MPDsfor certain device capabilities such that only these parts are updated.

Time-Shift Viewing and Network PVR

When time-shift viewing is supported, it may happen that for thelife-time of the session two or more MPDs or Movie Headers are valid. Inthis case by updating the MPD when necessary, but adding the validitymechanism or the period concept, a valid MPD may exist for the entiretime-window. This means that server may ensure that any MPD and Movieheader are announced for any period of time that is within the validtime-window for time-shift viewing. It is up to the client to ensurethat its available MPD and metadata for its current presentation time isvalid. Migration of a live session to a network PVR session using onlyminor MPD updates may also be supported.

Special Media Segments

An issue when the file format of ISO/IEC 14496-12 is used within a blockrequest streaming system is that, as described in the foregoing, it maybe advantageous to store the media data for a single version of thepresentation in multiple files, arranged in consecutive time segments.Furthermore it may be advantageous to arrange that each file begins witha Random Access Point. Further it may be advantageous to choose thepositions of the seek points during the video encoding process and tosegment the presentation into multiple files each beginning with a seekpoint based on the choice of seek points that was made during theencoding process, wherein each Random Access Point may or may not beplaced at the beginning of a file but wherein each file begins with aRandom Access Point. In one embodiment with the properties describedabove, the presentation metadata, or Media Presentation Description, maycontain the exact duration of each file, where duration is taken forexample to mean the different between the start time of the video mediaof a file and the start time of the video media of the next file. Basedon this information in the presentation metadata the client is able toconstruct a mapping between the global timeline for the mediapresentation and the local timeline for the media within each file.

In another embodiment, the size of the presentation metadata may beadvantageously reduced by specifying instead that every file or segmenthave the same duration. However in this case and where media files areconstructed according to the method above the duration of each file maynot be exactly equal to the duration specified in the media presentationdescription because a Random Access Point may not exist at the pointwhich is exactly the specified duration from the start of the file.

A further embodiment of the invention to provide for correct operationof the block-request streaming system despite the discrepancy mentionedabove is now described. In this method there may be provided an elementwithin each file which specifies the mapping of the local timeline ofthe media within the file (by which is meant the timeline starting fromtimestamp zero against which the decoding and composition timestamps ofthe media samples in the file are specified according to ISO/IEC14496-12) to the global presentation timeline. This mapping informationmay comprise a single timestamp in global presentation time thatcorresponds to the zero timestamp in the local file timeline. Themapping information may alternatively comprise an offset value thatspecifies the difference between the global presentation timecorresponding to the zero timestamp in local file timeline and theglobal presentation time corresponding to the start of the fileaccording to the information provided in the presentation metadata.

Example for such boxes may for example be the track fragment decode time(‘tfdt’) box or the track fragment adjustment box (‘tfad’) together withthe track fragment media adjustment (‘tfma’) box.

Example Client Including Segment List Generation

An example client will now be described. It might be used as a referenceclient for the server to ensure proper generation and updates of theMPD.

An HTTP streaming client is guided by the information provided in theMPD. It is assumed that the client has access to the MPD that itreceived at time T, i.e., the time it was able to successfully receivean MPD. Determining successful reception may include the clientobtaining an updated MPD or the client verifying that the MPD has notbeen updated since the previous successful reception.

An example client behaviour is introduced. For providing a continuousstreaming service to the user, the client first parses the MPD andcreates a list of accessible segments for each representation for theclient-local time at a current system time, taking into account segmentlist generation procedures as detailed below possibly using play-listsor using URL construction rules. Then, the client selects one ormultiple representations based on the information in the representationattributes and other information, e.g., available bandwidth and clientcapabilities. Depending on grouping representations may be presentedstandalone or jointly with other representations.

For each representation, the client acquires the binary metadata such asthe “moov” header for the representation, if present, and the mediasegments of the selected representations. The client accesses the mediacontent by requesting segments or byte ranges of segments, possiblyusing the segment list. The client may initially buffer media beforestarting the presentation and, once the presentation has started, theclient continues consuming the media content by continuously requestingsegments or parts of segments taking into account the MPD updateprocedures.

The client may switch representations taking into account updated MPDinformation and/or updated information from its environment, e.g.,change of available bandwidth. With any request for a media segmentcontaining a random access point, the client may switch to a differentrepresentation. When moving forward, i.e., the current system time(referred to as the “NOW time” to represent the time relative to thepresentation) advancing, the client consumes the accessible segments.With each advance in the NOW time, the client possibly expands the listof accessible segments for each representation according to theprocedures specified herein.

If the end of the media presentation is not yet reached and if thecurrent playback time gets within a threshold for which the clientanticipates to run out media of the media described in the MPD for anyconsuming or to be consumed representation, then the client may requestan update of the MPD, with a new fetch time reception time T. Oncereceived, the client then takes into account the possibly updated MPDand the new time T in the generation of the accessible segment lists.FIG. 29 illustrates a procedure for live services at different times atthe client.

Accessible Segment List Generation

Assume that the HTTP streaming client has access to an MPD and may wantto generate an accessible segment list for a wall-clock time NOW. Theclient is synchronised to a global time reference with certainprecision, but advantageously no direct synchronization to the HTTPstreaming server is required.

The accessible segment list for each representation is preferablydefined as a list pair of a segment start time and segment locator wherethe segment start time may be defined as being relative to the start ofthe representation without loss of generality. The start of therepresentation may be aligned with the start of a period or if thisconcept is applied. Otherwise, the representation start can be at thestart of the media presentation.

The client uses URL construction rules and timing as, for example,defined further herein. Once a list of described segments is obtained,this list is further restricted to the accessible ones, which may be asubset of the segments of the complete media presentation. Theconstruction is governed by the current value of the clock at the clientNOW time. Generally, segments are only available for any time NOW withina set of availability times. For times NOW outside this window, nosegments are available. In addition, for live services, assume the sometime checktime provides information on how far into the future the mediais described. The checktime is defined on the MPD-documented media timeaxis; when the client's playback time reaches checktime, itadvantageously requests a new MPD.

; when the client's playback time reaches checktime, it advantageouslyrequests a new MPD.

Then, the segment list is further restricted by the checktime togetherwith the MPD attribute TimeShiftBufferDepth such that only mediasegments available are those for which the sum of the start time of themedia segment and the representation start time falls in the intervalbetween NOW minus timeShiftBufferDepth minus the duration of the lastdescribed segment and the smaller value of either checktime or NOW.

Scalable Blocks

Sometimes available bandwidth falls so low that the block or blockscurrently being received at a receiver become unlikely to be completelyreceived in time to be played out without pausing the presentation. Thereceiver might detect such situations in advance. For example, thereceiver might determine that it is receiving blocks encoding 5 units ofmedia every 6 units of time, and has a buffer of 4 units of media, sothat the receiver might expect to have to stall, or pause, thepresentation, about 24 units of time later. With sufficient notice, thereceiver can react to such a situation by, for example, abandoning thecurrent stream of blocks and start requesting a block or blocks from adifferent representation of the content, such as one that uses lessbandwidth per unit of playout time. For example, if the receiverswitched to a representation where blocks encoded for at least 20% morevideo time for the same size blocks, the receiver might be able toeliminate the need to stall until the bandwidth situation improved.

However, it might be wasteful to have the receiver entirely discard thedata already received from the abandoned representation. In anembodiment of a block-streaming system described herein, the data withineach block can be encoded and arranged in such a way that certainprefixes of the data within the block can be used to continue thepresentation without the remainder of the block having been received.For example, the well-known techniques of scalable video encoding may beused. Examples of such video encoding methods include H.264 ScalableVideo Coding (SVC) or the temporal scalability of H.264 Advanced VideoCoding (AVC). Advantageously, this method allows the presentation tocontinue based on the portion of a block that has been received evenwhen reception of a block or blocks might be abandoned, for example dueto changes in the available bandwidth. Another advantage is that asingle data file may be used as the source for multiple differentrepresentations of the content. This is possible, for example, by makinguse of HTTP partial GET requests that select the subset of a blockcorresponding to the required representation.

One improvement detailed herein is an enchanced segment, a scalablesegment map. The scalable segment map contains the locations of thedifferent layers in the segment such that the client can access theparts of the segments accordingly and extract the layers. In anotherembodiment, the media data in the segment is ordered such that thequality of the segment is increasing while downloading the datagradually from the beginning of the segment. In another embodiment, thegradual increase of the quality is applied for each block or fragmentcontained in the segment, such that the fragment requests can be done toaddress the scalable approach.

FIG. 12 is a figure showing an aspect of scalable blocks. In thatfigure, a transmitter 1200 outputs metadata 1202, scalable layer 1(1204), scalable layer 2 (1206), and scalable layer 3 (1208), with thelatter being delayed. A receiver 1210 can then use metadata 1202,scalable layer 1 (1204), and scalable layer 2 (1206) to present mediapresentation 1212.

Independent Scalability Layers

As explained above, it is undesirable for a block-request streamingsystem to have to stall when the receiver is unable to receive therequested blocks of a specific representation of the media data in timefor its playout, as that often creates a poor user experience. Stallscan be avoided, reduced or mitigated by restricting a data rate of therepresentations chosen to be much less than the available bandwidth, sothat it becomes very unlikely that any given portion of the presentationwould not be received in time, but this strategy has the disadvantagethat the media quality is necessarily much lower than could in principlebe supported by the available bandwidth. A lower quality presentationthan is possible also can be interpreted as a poor user experience.Thus, the designer of a block-request streaming system is faced with achoice in the design of the client procedures, programming of the clientor configuration of hardware, to either request a content version thathas a much lower data rate than the available bandwidth, in which casethe user may suffer poor media quality, or to request a content versionthat has a data rate close to the available bandwidth, in which case theuser may suffer a high probability of pauses during the presentation asthe available bandwidth changes.

To handle such situations, the block-streaming systems described hereinmight be configured to handle multiple scalability layers independently,such that a receiver can make layered requests and a transmitter canrespond to layered requests.

In such embodiments, the encoded media data for each block may bepartitioned into multiple disjoint pieces, referred to herein as“layers”, such that a combination of layers comprises the whole of themedia data for a block and such that a client that has received certainsubsets of the layers may perform decoding and presentation of arepresentation of the content. In this approach, the ordering of thedata in the stream is such that contiguous ranges are increasing in thequality and the metadata reflects this.

An example of a technique that may be used to generate layers with theproperty above is the technique of Scalable Video Coding for example asdescribed in ITU-T Standards H.264/SVC. Another example of a techniquethat may be used to generate layers with the property above is thetechnique of temporal scalability layers as provided in ITU-T StandardH.264/AVC.

In these embodiments, metadata might be provided in the MPD or in thesegment itself that enables the construction of requests for individuallayers of any given block and/or combinations of layers and/or a givenlayer of multiple blocks and/or a combination of layers of multipleblocks. For example, the layers comprising a block might be storedwithin a single file and metadata might be provided specifying the byteranges within the file corresponding to the individual layers.

A file download protocol capable of specifying byte ranges, for exampleHTTP 1.1, may be used to request individual layers or multiple layers.Furthermore, as will be clear to one of skill in the art on reviewingthis disclosure, the techniques described above pertaining to theconstruction, request and download of blocks of variable size andvariable combinations of blocks may be applied in this context as well.

Combinations

A number of embodiments are now described which may be advantageouslyemployed by a block-request streaming client in order to achieve animprovement in the user experience and/or a reduction in servinginfrastructure capacity requirements compared to existing techniques byuse of media data partitioned into layers as described above.

In a first embodiment, the known techniques of a block request streamingsystem may be applied with the modification that different versions ofthe content are in some cases replaced by different combinations of thelayers. That is to say that where an existing system might provide twodistinct representations of the content the enhanced system describedhere might provide two layers, where one representation of the contentin the existing system is similar in bit-rate, quality and possiblyother metrics to the first layer in the enhanced system and the secondrepresentation of the content in the existing system is similar inbit-rate, quality and possibly other metrics to the combination of thetwo layers in the enhanced system. As a result the storage capacityrequired within the enhanced system is reduced compared to that requiredin the existing system. Furthermore, whereas the clients of existingsystem may issue requests for blocks of one representation or the otherrepresentation, clients of the enhanced system may issue requests foreither the first or both layers of a block. As a result, the userexperience in the two systems is similar. Furthermore, improved cachingis provided as even for different qualities common segments are usedwhich are then cached with higher likelihood.

In a second embodiment, a client in an enhanced block-request streamingsystem employing the method of layers now described may maintain aseparate data buffer for each of several layers of the media encoding.As will be clear to those of skill in the art of data management withinclient devices, these “separate” buffers may be implemented byallocation of physically or logically separate memory regions for theseparate buffers or by other techniques in which the buffered data isstored in a single or multiple memory regions and the separation of datafrom different layers is achieved logically through the use of datastructures which contain references to the storage locations of datafrom the separate layers and so in the follow the term “separatebuffers” should be understood to include any method in which the data ofthe distinct layers can be separately identified. The client issuesrequests for individual layers of each block based on the occupancy ofeach buffer, for example, the layers may be ordered in a priority ordersuch that a request for data from one layer may not be issued if theoccupancy of any buffer for a lower layer in the priority order is belowa threshold for that lower layer. In this method, priority is given toreceiving data from the lower layers in the priority order such that ifthe available bandwidth falls below that required to also receive higherlayers in the priority order then only the lower layers are requested.Furthermore, the thresholds associated with the different layers may bedifferent, such that for example lower layers have higher thresholds. Inthe case that the available bandwidth changes such that the data for ahigher layer cannot be received before the playout time of the blockthen the data for lower layers will necessarily already have beenreceived and so the presentation can continue with the lower layersalone. Thresholds for buffer occupancy may be defined in terms of bytesof data, playout duration of the data contained in the buffer, number ofblocks or any other suitable measure.

In a third embodiment, the methods of the first and second embodimentsmay be combined such that there are provided multiple mediarepresentations each comprising a subset of the layers (as in the firstembodiment) and such that the second embodiment is applied to a subsetof the layers within a representation.

In a fourth embodiment the methods of the first, second and/or thirdembodiments may be combined with the embodiment in which multipleindependent representations of the content are provided such that forexample at least one of the independent representations comprisesmultiple layers to which the techniques of the first, second and/orthird embodiments are applied.

Advanced Buffer Manager

In combination with buffer monitor 126 (see FIG. 2), an advanced buffermanager can be used to optimize a client-side buffer. Block-requeststreaming systems want to ensure that media playout can start quicklyand continue smoothly, while simultaneously providing the maximum mediaquality to the user or destination device. This may require that theclient requests blocks that have the highest media quality, but thatalso can be started quickly and received in time thereafter to be playedout without forcing a pause in the presentation.

In embodiments that use the advanced buffer manager, the managerdetermines which blocks of media data to request and when to make thoserequests. An advanced buffer manager might, for example, be providedwith a set of metadata for the content to be presented, this metadataincluding a list of representations available for the content andmetadata for each representation. Metadata for a representation maycomprise information about the data rate of the representation and otherparameters, such as video, audio or other codecs and codec parameters,video resolution, decoding complexity, audio language and any otherparameters that might affect the choice of representation at the client.

Metadata for a representation may also comprise identifiers for theblocks into which the representation has been segmented, theseidentifiers providing the information needed for the client to request ablock. For example, where the request protocol is HTTP, the identifiermight be an HTTP URL possibly together with additional informationidentifying a byte range or time span within the file identified by theURL, this byte range or time span identifying the specific block withinthe file identified by the URL.

In a specific implementation, the advanced buffer manager determineswhen a receiver makes a request for new blocks and might itself handlesending the requests. In a novel aspect, the advanced buffer managermakes requests for new blocks according to the value of a balancingratio that balances between using too much bandwidth and running out ofmedia during a streaming playout.

The information received by buffer monitor 126 from block buffer 125 caninclude indications of each event when media data is received, how muchhas been received, when playout of media data has started or stopped,and the speed of media playout. Based on this information, buffermonitor 126 might calculate a variable representing a current buffersize, B_(current). In these examples, B_(current) represents the amountof media contained in a client or other device buffer or buffers andmight be measured in units of time so that B_(current) represents theamount of time that it would take to playout all of the mediarepresented by the blocks or partial blocks stored in the buffer orbuffers if no additional blocks or partial blocks were received. Thus,B_(current) represents the “playout duration”, at normal playout speed,of the media data available at the client, but not yet played.

As time passes, the value of B_(current) will decrease as media isplayed out and may increase each time new data for a block is received.Note that, for the purposes of this explanation, it is assumed that ablock is received when the entire data of that block is available atblock requestor 124, but other measures might be used instead forexample to take into account the reception of partial blocks. Inpractice, reception of a block may take place over a period of time.

FIG. 13 illustrates a variation of the value of B_(current) over time,as media is played out and blocks are received. As shown in FIG. 13, thevalue of B_(current) is zero for times less than to, indicating that nodata has been received. At t₀, the first block is received and the valueof B_(current) increases to equal the playout duration of the receivedblock. At this time, playout has not yet begun and so the value ofB_(current) remains constant, until time t₁, at which a second blockarrives and B_(current) increases by the size of this second block. Atthis time, playout begins and the value of B_(current) begins todecrease linearly, until time t₂, at which time a third block arrives.

The progression of B_(current) continues in this “sawtooth” manner,increasing stepwise each time a block is received (at times t₂, t₃, t₄,t₅ and t₆) and decreasing smoothly as data is played out in between.Note that in this example, playout proceeds at the normal playout ratefor the content and so the slope of the curve between block reception isexactly −1, meaning that one second of media data is played for each onesecond of real time that passes. With frame-based media played out at agiven number of frames per second, e.g., 24-frames per second, the slopeof −1 will be approximated by small step functions that indicate theplayout of each individual frame of data, e.g., steps of − 1/24 of asecond when each frame is played out.

FIG. 14 shows another example of the evolution of Bcurrent over time. Inthat example, the first block arrives at t₀ and playout beginsimmediately. Block arrival and playout continues until time t₃, at whichthe value of B_(current) reaches zero. When that happens, no furthermedia data is available for playout, forcing a pause in the mediapresentation. At time t₄, a fourth block is received and playout canresume. This example therefore shows a case where the reception of thefourth block was later than desired, resulting in a pause in playout andthus a poor user experience. Thus, a goal of the advanced buffer managerand other features is to reduce the probability of this event, whilesimultaneously maintaining high media quality.

Buffer monitor 126 may also calculate another metric, B_(ratio)(t),which is the ratio of the media received in a given time period to thelength of the time period. More specifically, B_(ratio)(t) is equal toT_(received)/(T_(now)−t), where T_(received) is the amount of media(measured by its playout time) received in the time period from t, sometime earlier than the current time up to the current time, T_(now).

B_(ratio)(t) can be used to measure the rate of change of B_(current).B_(ratio)(t)=0 is the case where no data has been received since time t;B_(current) will have been reduced by (T_(now)−t) since that time,assuming media is playing out. B_(ratio)(t)=1 is the case where media isreceived in the same amount as it is being played out, for time(T_(now)−t); B_(current) will have the same value at time T_(now) as attime t. B_(ratio)(t)>1 is the case where more data has been receivedthan is necessary to play out for time (T_(now)−t); B_(current) willhave increased from time t to time T_(now).

Buffer Monitor 126 further calculates a value State, which may take adiscrete number of values. Buffer Monitor 126 is further equipped with afunction, NewState(B_(current), B_(ratio)), which, given the currentvalue of B_(current) and values of B_(ratio) for t<T_(now), provides anew State value as output. Whenever B_(current) and B_(ratio) cause thisfunction to return a value different from the current value of State,the new value is assigned to State and this new State value indicated toblock selector 123.

The function NewState may be evaluated with reference to the space ofall possible values of the pair (B_(current), B_(ratio)(T_(now)−T_(x)))where T_(x) may be a fixed (configured) value, or may be derived fromB_(current), for example by a configuration table which maps from valuesof B_(current) to values of T_(x), or may depend on the previous valueof State. Buffer monitor 126 is supplied with a one or morepartitionings of this space, where each partitioning comprises sets ofdisjoint regions, each region being annotated with a State value.Evaluation of the function NewState then comprises the operation ofidentifying a partitioning and determining the region into which thepair (B_(current), B_(ratio)(T_(now)−T_(x))) falls. The return value isthen the annotation associated with that region. In a simple case, onlyone partitioning is provided. In a more complex case, the partitioningmay depend on the pair (B_(current), B_(ratio)(T_(now)−T_(x))) at theprevious time of evaluation of the NewState function or on otherfactors.

In a specific embodiment, the partitioning described above may be basedon a configuration table containing a number of threshold values forB_(current) and a number of threshold values for B_(ratio).Specifically, let the threshold values for B_(current) beB_(thresh)(0)=0, B_(thresh)(1), B_(thresh)(n₁), B_(thresh)(n₁+1)=∞,where n₁ is the number of non-zero threshold values for B_(current). Letthe threshold values for Bravo be B_(r-thresh)(0)=0, B_(r-thresh)(1),B_(r-thresh)(n₂), B_(r-thresh)(n₂+1)=∞, where n₂ is the number ofthreshold values for B_(ratio). These threshold values define apartitioning comprising an (n₁+1) by (n₂+1) grid of cells, where thei-th cell of the j-th row corresponds to the region in whichB_(thresh)(i−1)<=B_(current)<B_(thresh)(i) andB_(r-thresh)(j−1)<=B_(ratio)<B_(r-thresh)(j). Each cell of the griddescribed above is annotated with a state value, such as by beingassociated with particular values stored in memory, and the functionNewState then returns the state value associated with the cell indicatedby the values B_(current) and B_(ratio)(T_(now)−T_(x)).

In a further embodiment, a hysteresis value may be associated to eachthreshold value. In this enhanced method, evaluation of the functionNewState may be based on a temporary partitioning constructed using aset of temporarily modified threshold values, as follows. For eachB_(current) threshold value that is less than the B_(current) rangecorresponding to the chosen cell on the last evaluation of NewState, thethreshold value is reduced by subtracting the hysteresis valueassociated with that threshold. For each B_(current) threshold valuethat is greater than the B_(current) range corresponding to the chosencell on the last evaluation of NewState, the threshold value isincreased by adding the hysteresis value associated with that threshold.For each B_(ratio) threshold value that is less than the B_(ratio) rangecorresponding to the chosen cell on the last evaluation of NewState, thethreshold value is reduced by subtracting the hysteresis valueassociated with that threshold. For each B_(ratio) threshold value thatis greater than the B_(ratio) range corresponding to the chose cell onthe last evaluation of NewState, the threshold value is increased byadding the hysteresis value associated with that threshold. The modifiedthreshold values are used to evaluate the value of NewState and then thethreshold values are returned to their original values.

Other ways of defining partitionings of the space will be obvious tothose of skill in the art upon reading this disclosure. For example, apartitioning may be defined by the use of inequalities based on linearcombinations of B_(ratio) and B_(current), for example linear inequalitythresholds of the form α1·B_(ratio)+α2·B_(current)≤α0 for real-valuedα0, α1, and α2, to define half-spaces within the overall space anddefining each disjoint set as the intersection of a number of suchhalf-spaces.

The above description is illustrative of the basic process. As will beclear to those skilled in the art of real-time programming upon readingthis disclosure, efficient implementations are possible. For example, ateach time that new information is provided to buffer monitor 126, it ispossible to calculate the future time at which NewState will transitionto a new value if for example no further data for blocks is received. Atimer is then set for this time and in the absence of further inputsexpiry of this timer will cause the new State value to be sent to blockselector 123. As a result, computations need only be performed when newinformation is provided to buffer monitor 126 or when a timer expires,rather than continuously.

Suitable values of State could be “Low”, “Stable” and “Full”. An exampleof a suitable set of threshold values and the resulting cell grid isshown in FIG. 15.

In FIG. 15, B_(current) thresholds are shown on the horizontal axis inmilliseconds, with hysteresis values shown below as “+/−value”.B_(ratio) thresholds are shown on the vertical axis in permille (i.e.,multiplied by 1000) with hysteresis values shown below as “+/−value”.State values are annotated into the grid cells as “L”, “S” and “F” for“Low”, “Stable” and “Full” respectively.

Block selector 123 receives notifications from block requestor 124whenever there is an opportunity to request a new block. As describedabove, block selector 123 is provided with information as to theplurality of blocks available and metadata for those blocks, includingfor example information about the media data rate of each block.

Information about the media data rate of a block may comprise the actualmedia data rate of the specific block (i.e., the block size in bytesdivided by the playout time in seconds), the average media data rate ofthe representation to which the block belongs or a measure of theavailable bandwidth required, on a sustained basis, to play out therepresentation to which the block belongs without pauses, or acombination of the above.

Block selector 123 selects blocks based on the State value lastindicated by buffer monitor 126. When this State value is “Stable”,block selector 123 selects a block from the same representation as theprevious selected block. The block selected is the first block (inplayout order) containing media data for a time period in thepresentation for which no media data has previously been requested.

When the State value is “Low”, block selector 123 selects a block from arepresentation with a lower media data rate than that of the previouslyselected block. A number of factors can influence the exact choice ofrepresentation in this case. For example, block selector 123 might beprovided with an indication of the aggregate rate of incoming data andmay choose a representation with a media data rate that is less thanthat value.

When the State value is “Full”, block selector 123 selects a block froma representation with a higher media data rate than that of thepreviously selected block. A number of factors can influence the exactchoice of representation in this case. For example, block selector 123may be provided with an indication of the aggregate rate of incomingdata and may choose a representation with a media data rate that is notmore than that value.

A number of additional factors may further influence the operation ofblock selector 123. In particular, the frequency with which the mediadata rate of the selected block is increased may be limited, even ifbuffer monitor 126 continues to indicate the “Full” state. Furthermore,it is possible that block selector 123 receives a “Full” stateindication but there are no blocks of higher media data rate available(for example because the last selected block was already for the highestavailable media data rate). In this case, block selector 123 may delaythe selection of the next block by a time chosen such that the overallamount of media data buffered in block buffer 125 is bounded above.

Additional factors may influence the set of blocks that are consideredduring the selection process. For example, the available blocks may belimited to those from representations whose encoding resolution fallswithin a specific range provided to block selector 123.

Block selector 123 may also receive inputs from other components thatmonitor other aspects of the system, such as availability ofcomputational resources for media decoding. If such resources becomescarce, block selector 123 may choose blocks whose decoding is indicatedto be of lower computational complexity within the metadata (forexample, representations with lower resolution or frame rate aregenerally of lower decoding complexity).

The above-described embodiment brings a substantial advantage in thatthe use of the value B_(ratio) in the evaluation of the NewStatefunction within buffer monitor 126 allows for a faster increase inquality at the start of the presentation compared to a method thatconsiders only B_(current). Without considering B_(ratio), a largeamount of buffered data may be accumulated before the system is able toselect blocks with a higher media data rate and hence a higher quality.However, when the B_(ratio) value is large, this indicates that theavailable bandwidth is much higher than the media data rate of thepreviously received blocks and that even with relatively little buffereddata (i.e., low value for B_(current)), it remains safe to requestblocks of higher media data rate and hence higher quality. Equally, ifthe B_(ratio) value is low (<1, for example) this indicates that theavailable bandwidth has dropped below the media data rate of thepreviously requested blocks and thus, even if B_(current) is high, thesystem will switch to a lower media data rate and hence a lower quality,for example to avoid reaching the point where B_(current)=0 and theplayout of the media stalls. This improved behavior may be especiallyimportant in environments where network conditions and thus deliveryspeeds may vary quickly and dynamically, e.g., users streaming to mobiledevices.

Another advantage is conferred by the use of configuration data tospecify the partitioning of the space of values of (B_(current),B_(ratio)). Such configuration data can be provided to buffer monitor126 as part of the presentation metadata or by other dynamic means.Since, in practical deployments, the behavior of user networkconnections can be highly variable between users and over time for asingle user, it may be difficult to predict partitionings that will workwell for all users. The possibility to provide such configurationinformation to users dynamically allows for good configuration settingsto be developed over time according to accumulated experience.

Variable Request Sizing

A high frequency of requests may be required if each request is for asingle block and if each block encodes for a short media segment. If themedia blocks are short, the video playout is moving from block to blockquickly, which provides more frequent opportunities for the receiver toadjust or change its selected data rate by changing the representation,improving the probability that playout can continue without stalling.However, a downside to a high frequency of requests is that they mightnot be sustainable on certain networks in which available bandwidth isconstrained in the client to server network, for example, in wirelessWAN networks such as 3G and 4G wireless WANs, where the capacity of thedata link from client to network is limited or can become limited forshort or long periods of time due to changes in radio conditions.

A high frequency of requests also implies a high load on the servinginfrastructure, which brings associated costs in terms of capacityrequirements. Thus, it would be desirable to have some of the benefitsof a high frequency of requests without all of the disadvantages.

In some embodiments of a block streaming system, the flexibility of highrequest frequency is combined with less frequent requests. In thisembodiment, blocks may be constructed as described above and aggregatedinto segments containing multiple blocks, also as described above. Atthe beginning of the presentation, the processes described above inwhich each request references a single block or multiple concurrentrequests are made to request parts of a block are applied to ensure afast channel zapping time and therefore a good user experience at thestart of the presentation. Subsequently, when a certain condition, to bedescribed below, is met, the client may issue requests which encompassmultiple blocks in a single request. This is possible because the blockshave been aggregated into larger files or segments and can be requestedusing byte or time ranges. Consecutive byte or time ranges can beaggregated into a single larger byte or time range resulting in a singlerequest for multiple blocks, and even discontinuous blocks can berequested in one request.

One basic configuration that can be driven by deciding whether torequest a single block (or a partial block) or to request multipleconsecutive blocks is have the configuration base the decision onwhether or not the requested blocks are likely to be played out or not.For example, if it is likely that there will be a need to change toanother representation soon, then it is better for the client to makerequests for single blocks, i.e., small amounts of media data. Onereason for this is that if a request for multiple blocks is made when aswitch to another representation might be imminent is that the switchmight be made before the last few blocks of the request are played out.Thus, the download of these last few blocks might delay the delivery ofmedia data of the representation to which the switch is made, whichcould cause media playout stalls.

However, requests for single blocks do result in a higher frequency ofrequests. On the other hand, if it is unlikely that there will be a needto change to another representation soon, then it can be preferred tomake requests for multiple blocks, as all of these blocks are likely tobe played out, and this results in a lower frequency of requests, whichcan substantially lower the request overhead, especially if it istypical that there is no imminent change in representation.

In conventional block aggregation systems, the amount requested in eachrequest is not dynamically adjusted, i.e., typically each request is foran entire file, or each request is for approximately the same amount ofthe file of a representation (sometimes measured in time, sometimes inbytes). Thus, if all requests are smaller, then the request overhead ishigh, whereas if all requests are larger, then this increases thechances of media stall events, and/or providing a lower quality of mediaplayout if lower quality representations are chosen to avoid having toquickly change representations as network conditions vary.

An example of a condition which, when met, may cause subsequent requeststo reference multiple blocks, is a threshold on the buffer size,B_(current). If B_(current) is below the threshold, then each requestissued references a single block. If B_(current) is greater than orequal to the threshold then each request issued references multipleblocks. If a request is issued which references multiple blocks, thenthe number of blocks requested in each single request may be determinedin one of several possible ways. For example, the number may beconstant, for example, two. Alternatively, the number of blocksrequested in a single request may be dependent on the buffer state andin particular on B_(current). For example, a number of thresholds may beset, with the number of blocks requested in a single request beingderived from the highest of the multiple thresholds that is less thanB_(current).

Another example of a condition which, when met, may cause requests toreference multiple blocks, is the value State variable described above.For example, when State is “Stable” or “Full” then requests may beissued for multiple blocks, but when State is “Low” then all requestsmay be for one block.

Another embodiment is shown in FIG. 16. In this embodiment, when thenext request is to be issued (determined in step 1300), the currentState value and Bcurrent is used to determine the size of the nextrequest. If the current State value is “Low” or the current State valueis “Full” and the current representation is not the highest available(determined in step 1310, answer is “Yes”), then the next request ischosen to be short, for example just for the next block (blockdetermined and request made in step 1320). The rationale behind this isthat these are conditions where it is likely that quite soon there willbe a change of representations. If the current State value is “Stable”or the current State value is “Full” and the current representation isthe highest available (determined in step 1310, answer is “No”), thenthe duration of the consecutive blocks requested in the next request ischosen to be proportional to an a-fraction of B_(current) for some fixedα<1 (blocks determined in step 1330, request made in step 1340), e.g.,for α=0.4, if B_(current)=5 seconds, then the next request might be forapproximately 2 seconds of blocks, whereas if B_(current)=10 seconds,then the next request might be for approximately 4 seconds of blocks.One rationale for this is that in these conditions it might be unlikelythat a switch to a new representation will be made for an amount of timethat is proportional to B_(current).

Flexible Pipelining

Block-streaming systems might use a file request protocol that has aparticular underlying transport protocol, for example TCP/IP. At thebeginning of a TCP/IP or other transport protocol connection, it maytake some considerable time to achieve utilization of the full availablebandwidth. This may result in a “connection startup penalty” every timea new connection is started. For example, in the case of TCP/IP, theconnection startup penalty occurs due to both the time taken for theinitial TCP handshake to establish the connection and the time taken forthe congestion control protocol to achieve full utilization of theavailable bandwidth.

In this case, it may be desirable to issue multiple requests using asingle connection, in order to reduce the frequency with which theconnection startup penalty is incurred. However, some file transportprotocols, for example HTTP, do not provide a mechanism to cancel arequest, other than closing the transport layer connection altogetherand thereby incurring a connection startup penalty when a new connectionis established in place of the old one. An issued request may need to becancelled if it is determined that available bandwidth has changed and adifferent media data rate is required instead, i.e., there is a decisionto switch to a different representation. Another reason for cancellingan issued request may be if the user has requested that the mediapresentation be ended and a new presentation begun (perhaps of the samecontent item at a different point in the presentation or perhaps of anew content item).

As is known, the connection startup penalty can be avoided by keepingthe connection open and re using the same connection for subsequentrequests and as is also known the connection can be kept fully utilizedif multiple requests are issued at the same time on the same connection(a technique known as “pipelining” in the context of HTTP). However, adisadvantage of issuing multiple requests at the same time, or moregenerally in such a way that multiple requests are issued beforeprevious requests have completed over a connection, may be that theconnection is then committed to carrying the response to those requestsand so if changes to which requests should be issued becomes desirablethen the connection may be closed if it becomes necessary to cancelrequests already issued that are no longer desired.

The probability that an issued request needs to be cancelled may be inpart dependent on the duration of the time interval between the issuingof the request and the playout time of the requested block in the sensethat when this time interval is high the probability that an issuedrequest needs to be cancelled is also high (because it is likely thatthe available bandwidth changes during the interval).

As is known, some file download protocols have the property that asingle underlying transport layer connection can advantageously be usedfor multiple download requests. For example, HTTP has this property,since reuse of a single connection for multiple requests avoids the“connection startup penalty” described above for requests other than thefirst. However, a disadvantage of this approach is that the connectionis committed to transporting the requested data in each issued requestand therefore if a request or requests need to be cancelled then eitherthe connection may be closed, incurring the connection startup penaltywhen a replacement connection is established, or the client may wait toreceive data that is no longer needed, incurring a delay in thereception of subsequent data.

We now describe an embodiment which retains the advantages of connectionreuse without incurring this disadvantage and which also additionallyimproves the frequency with which connections can be reused.

The embodiments of the block-streaming systems described herein areconfigured to reuse a connection for multiple requests without having tocommit the connection at the start to a particular set of requests.Essentially, a new request is issued on an existing connection whenalready issued requests on the connection have not yet completed, butare close to completion. One reason for not waiting until the existingrequests complete is that if the previous requests complete, then theconnection speed could degrade, i.e., the underlying TCP session couldgo into an idle state, or the TCP cwnd variable could be substantiallyreduced, thereby substantially reducing the initial download speed ofthe new request issued on that connection. One reason for waiting untilclose to completion before issuing an additional request is because if anew request is issued long before previous requests complete, then thenew issued request may not even commence for some substantial period oftime, and it could be the case that during this period of time beforethe new issued request commences the decision to make the new request isno longer valid, e.g., due to a decision to switch representations.Thus, embodiment of clients that implement this technique will issue anew request on a connection as late as possible without slowing down thedownload capabilities of the connection.

The method comprises monitoring the number of bytes received on aconnection in response to the latest request issued on this connectionand applying a test to this number. This can be done by having thereceiver (or the transmitter, if applicable) configured to monitor andtest.

If the test passes, then a further request may be issued on theconnection. One example of a suitable test is whether the number ofbytes received is greater than a fixed fraction of the size of the datarequested. For example, this fraction could be 80%. Another example of asuitable test is based on the following calculation, as illustrated inFIG. 17. In the calculation, let R be an estimate of the data rate ofthe connection, T be an estimate of the Round Trip Time (“RTT”) and X benumeric factor that, for example, could be a constant set to a valuebetween 0.5 and 2, where estimates of R and T are updated on a regularbasis (updated in step 1410). Let S be the size of the data requested inthe last request, B be the number of bytes of the requested datareceived (calculated in step 1420).

A suitable test would be to have the receiver (or the transmitter, ifapplicable) execute a routine to evaluate the inequality (S−B)<X·R·T(tested in step 1430), and if “Yes” then take an action. For example, atest could be made to see if there is another request ready to be issuedon the connection (tested in step 1440), and if “Yes” then issue thatrequest to the connection (step 1450) and if “No” then the processreturns to step 1410 to continue updating and testing. If the result ofthe test in step 1430 is “No” then the process returns to step 1410 tocontinue updating and testing.

The inequality test in step 1430 (performed by appropriately programmedelements, for example) causes each subsequent request to be issued whenthe amount of remaining data to be received is equal to X times theamount of data that can be received at the current estimated receptionrate within one RTT. A number of methods to estimate the data rate, R,in step 1410 are known in the art. For example, the data rate may beestimated as Dt/t, where Dt is the number of bits received in thepreceding t seconds and where t may be, for example, 1 s or 0.5 s orsome other interval. Another method is an exponential weighted average,or first order Infinite Impulse Response (IIR) filter of the incomingdata rate. A number of methods to estimate the RTT, T, in step 1410 areknown in the art.

The test in step 1430 can be applied to the aggregate of all activeconnections on an interface, as explained in more detail below.

The method further comprises constructing a list of candidate requests,associating each candidate request with a set of suitable servers towhich the request can be made and ordering the list of candidaterequests in order of priority. Some entries in the list of candidaterequests may have the same priority. Servers in the list of suitableservers associated with each candidate request are identified byhostnames. Each hostname corresponds to a set of Internet Protocoladdresses which can be obtained from the Domain Name System as is wellknown. Therefore each possible request on the list of candidate requestsis associated with a set of Internet Protocol addresses, specificallythe union of the sets of Internet Protocol Addresses associated with thehostnames associated with the servers associated with the candidaterequest. Whenever the test described in step 1430 is met for aconnection, and no new request has yet been issued on that connection,the highest priority request on the lists of candidate requests withwhich the Internet Protocol address of the destination of the connectionis associated is chosen, and this request is issued on the connection.The request is also removed from the list of candidate requests.

Candidate requests may be removed (cancelled) from the list of candidaterequests, new requests may be added to the candidate list with apriority that is higher than already existing requests on the candidatelist, and existing requests on the candidate list may have theirpriority changed. The dynamic nature of which requests are on the listof candidate requests, and the dynamic nature of their priority on thecandidate list, can alter which requests might be issued next dependingon when a test of the type described in step 1430 is satisfied.

For example, it could be possible that if the answer to the testdescribed in step 1430 is “Yes” at some time t then the next requestissued would be a request A, whereas if the answer to the test describedin step 1430 is not “Yes” until some time t′>t then the next requestissued would instead be a request B, because either request A wasremoved from the list of candidate requests between time t and t′, orbecause request B was added to the list of candidate requests withhigher priority than request A between time t and t′, or because requestB was on the candidate list at time t but with lower priority thanrequest A, and between time t and t′ the priority of request B was madehigher than that of request A.

FIG. 18 illustrates an example of a list of requests on the candidatelist of requests. In this example, there are three connections, andthere are six requests on the candidate list, labeled A, B, C, D, E andF. Each of the requests on the candidate list can be issued on a subsetof the connections as indicated, e.g., request A can be issued onconnection 1, whereas request F can be issued on connection 2 orconnection 3. The priority of each request is also labeled in FIG. 18,and a lower priority value indicates that a request is higher priority.Thus, requests A and B with priority 0 are the highest priorityrequests, whereas request F with a priority value of 3 is the lowestpriority among the requests on the candidate list.

If, at this point in time t, connection 1 passes the test described instep 1430, then either request A or request B is issued on connection 1.If instead connection 3 passes the test described in step 1430 at thistime t, then request D is issued on connection 3, since request D is therequest with the highest priority that can be issued on connection 3.

Suppose that for all connections the answer to the test described instep 1430 from time t to some later time t′ is “No”, and between time tand t′ request A changes its priority from 0 to 5, request B is removedfrom the candidate list, and a new request G with priority 0 is added tothe candidate list. Then, at time t′, the new candidate list might be asshown in FIG. 19.

If at time t′ connection 1 passes the test described in step 1430, thenrequest C with priority 4 is issued on connection 1, since it is thehighest priority request on the candidate list that can be issued onconnection 1 at this point in time.

Suppose in this same situation that instead request A would have beenissued on connection 1 at time t (which was one of the two highestpriority choices for connection 1 at time t as shown in FIG. 18). Sincethe answer to the test described in step 1430 from time t to some latertime t′ is “No” for all connections, connection 1 is still deliveringdata up till at least time t′ for requests issued prior to time t, andthus request A would not have commenced until at least time t′. Issuingrequest C at time t′ is a better decision than issuing request A at timet would have been, since request C commences at the same time after t′as request A would have commenced, and since by that time request C ishigher priority than request A.

As another alternative, if the test of the type described in step 1430is applied to the aggregate of the active connections a connection maybe chosen that has a destination whose Internet Protocol Address isassociated with the first request on the list of candidate requests oranother request with the same priority as said first request.

A number of methods are possible for the construction of the list ofcandidate requests. For example, the candidate list could contain nrequests representing requests for a next n portions of data of thecurrent representation of the presentation in time sequence order, wherethe request for the earliest portion of data has highest priority andthe request for the latest portion of data has lowest priority. In somecases n may be one. The value of n may depend on the buffer sizeB_(current), or the State variable or another measure of the state ofthe client buffer occupancy. For example, a number of threshold valuesmay be set for B_(current) and a value associated with each thresholdand then the value of n is taken to be the value associated with thehighest threshold that is less than B_(current).

The embodiment described above ensures flexible allocation of requeststo connections, ensuring that preference is given to reusing an existingconnection even if the highest priority request is not suitable for thatconnection (because the destination IP address of the connection is notone that is allocated to any of the hostnames associated with therequest). The dependency of n on B_(current) or State or another measureof the client buffer occupancy ensures that such “out of priority order”requests are not issued when the client is in urgent need of issuanceand completion of the request associated with the next portion of datato be played out in the time sequence.

These methods can be advantageously combined with cooperative HTTP andFEC.

Consistent Server Selection

As is well known, files to be downloaded using a file download protocolare commonly identified by an identifier comprising a hostname and afilename. For example this is the case for the HTTP protocol in whichcase the identifier is a Uniform Resource Identifier (URI). A hostnamemay correspond to multiple hosts, identified by Internet Protocoladdresses. For example this is a common method of spreading the load ofrequests from multiple clients across multiple physical machines. Inparticular this approach is commonly taken by Content Delivery Networks(CDNs). In this case a request issued on a connection to any of thephysical hosts is expected to succeed. A number of methods are known bywhich a client may select from amongst the Internet Protocol Addressesassociated with a hostname. For example, these addresses are typicallyprovided to the client via the Domain Name System and are provided inpriority order. A client may then choose the highest priority (first)Internet Protocol Address. However, generally there is no coordinationbetween clients as to how this choice is made, with the result thatdifferent clients may request the same file from different servers. Thismay result in the same file being stored in the cache of nearby multipleservers, which lowers the efficiency of the cache infrastructure.

This can be handled by a system that advantageously increases theprobability that two clients requesting the same block will request thisblock from the same server. The novel method described here comprisesselecting from amongst the available Internet Protocol Addresses in amanner determined by the identifier of the file to be requested and insuch a way that different clients presented with the same or similarchoices of Internet Protocol addresses and file identifiers will makethe same choice.

A first embodiment of the method is described with reference to FIG. 20.The client first obtains a set of Internet Protocol addresses IP₁, IP₂,. . . , IP_(n), as shown in step 1710. If there is a file that requestsare to be issued for, as decided in step 1720, then the clientdetermines which Internet Protocol address to issue requests for thefile, as determined in steps 1730-1770. Given a set of Internet Protocoladdresses and an identifier for a file to be requested the methodcomprises ordering the Internet Protocol addresses in a mannerdetermined by the file identifier. For example, for each InternetProtocol address a byte string is constructed comprising theconcatenation of the Internet Protocol address and the file identifier,as shown in step 1730. A hash function is applied to this byte string,as shown in step 1740, and the resulting hash values are arrangedaccording to a fixed ordering, as shown in step 1750, for exampleincreasing numerical order, inducing an ordering on the InternetProtocol addresses. The same hash function can be used by all clients,thereby guaranteeing that the same result is produced by the hashfunction on a given input by all clients. The hash function might bestatically configured into all clients in a set of clients, or allclients in a set of client might obtain a partial or full description ofthe hash function when the clients obtain the list of Internet Protocoladdresses, or all clients in a set of client might obtain a partial orfull description of the hash function when the clients obtain the fileidentifier, or the hash function may be determined by other means. TheInternet Protocol address that is first in this ordering is chosen andthis address is then used to establish a connection and issue requestsfor all or portions of the file, as shown in steps 1760 and 1770.

The method above may be applied when a new connection is established torequest a file. It may also be applied when a number of establishedconnections are available and one of these may be chosen to issue a newrequest.

Furthermore, when an established connection is available and a requestmay be chosen from amongst a set of candidate requests with equalpriority an ordering on the candidate requests is induced, for example,by the same method of hash values described above and the candidaterequest appearing first in this ordering is chosen. The methods may becombined to select both a connection and candidate request from amongsta set of connections and requests of equal priority, again by computinga hash for each combination of connection and request, ordering thesehash values according to a fixed ordering and choosing the combinationwhich occurs first in the ordering induced on the set of combinations ofrequests and connections.

This method has advantage for the following reason: a typical approachtaken by a block serving infrastructure such as that shown in FIG. 1(BSI 101) or FIG. 2 (BSIs 101), and in particular an approach commonlytaken by CDNs, is to provide multiple caching proxy servers whichreceive client requests. A caching proxy server may not be provided withthe file requested in a given request and in this case such serverstypically forward the request to another server, receive the responsefrom that server, typically including the requested file, and forwardthe response to the client. The caching proxy server may also store(cache) the requested file so that it can response immediately tosubsequent requests for the file. The common approach described abovehas the property that the set of files stored on a given caching proxyserver is largely determined by the set of requests that the cachingproxy server has received.

The method described above has the following advantage. If all clientsin a set of clients are provided the same list of Internet Protocoladdresses then these clients will use the same Internet Protocol addressfor all requests issued for the same file. If there are two differentlists of Internet Protocol addresses and each client is provided withone of these two lists then the clients will use at most two differentInternet Protocol addresses for all requests issued for the same file.In general, if the lists of Internet Protocol addresses provided toclients are similar then the clients will use a small set of theprovided Internet Protocol addresses for all requests issued for thesame file. Since proximate clients tend to be provided similar lists ofInternet Protocol addresses, it is likely that proximate clients issuerequests for a file from only a small portion of the caching proxyservers available to those clients. Thus, there will be only a smallfraction of caching proxy servers that cache the file, whichadvantageously minimizes the amount of caching resources used to cachethe file.

Preferably the hash function has the property that a very small fractionof different inputs are mapped to the same output, and that differentinputs are mapped to essentially random outputs, to ensure that for agiven set of Internet Protocol addresses, the proportion of files forwhich a given one of the Internet Protocol addresses is first in thesorted list produced by step 1750 is approximately the same for allInternet Protocol addresses in the list. On the other hand, it isimportant that the hash function is deterministic, in the sense that fora given input the output of the hash function is the same for allclients.

Another advantage of the method described above is the following.Suppose that all clients in a set of clients are provided the same listof Internet Protocol addresses. Because of the properties of the hashfunction just described, it is likely that the requests for differentfiles from these clients will be evenly spread across the set ofInternet Protocol addresses, which in turn means that the requests willbe spread evenly across the caching proxy servers. Thus, the cachingresources used for storing these files is spread evenly across thecaching proxy servers, and the requests for files is spread evenlyacross the caching proxy servers. Thus, the method provides both storagebalancing and load balancing across the caching infrastructure.

A number of variations to the approach described above are known tothose of skill in the art and in many cases these variations retain theproperty that the set of files stored on a given proxy is determined atleast in part by the set of requests the caching proxy server hasreceived. In the common case in which a given hostname resolves tomultiple physical caching proxy servers, it will be common that allthese servers will eventually store a copy of any given file that isfrequently requested. Such duplication may be undesirable, since storageresources on the caching proxy servers are limited and as a result filesmay be, on occasion, removed (purged) from the cache. The novel methoddescribed here ensures that requests for a given file are directed tocaching proxy servers in such a way that this duplication is reduced,thereby reducing the need to remove files from the cache and therebyincreasing the likelihood that any given file is present in (i.e., hasnot been purged from) in the proxy cache.

When a file is present in the proxy cache, the response sent to theclient is faster, which has advantage in reducing the probability thatthe requested file arrives late, which may result in a pause in mediaplayout and therefore a bad user experience. Additionally, when a fileis not present in the proxy cache the request may be sent to anotherserver, causing additional load on both the serving infrastructure andthe network connections between servers. In many cases the server towhich the request is sent may be at a distant location and thetransmission of the file from this server back to the caching proxyserver may incur transmission costs. Therefore the novel methoddescribed here results in a reduction in these transmission costs.

Probabilistic Whole File Requests

A particular concern in the case that the HTTP protocol is used withRange requests is the behavior of cache servers that are commonly usedto provide scalability in the serving infrastructure. While it may becommon for HTTP cache servers to support the HTTP Range header, theexact behavior of different HTTP cache servers varies by implementation.Most cache server implementations serve Range requests from cache in thecase that the file is available in the cache. A common implementation ofHTTP Cache servers always forwards downstream HTTP requests containingRange header to an upstream node unless the cache server has a copy ofthe file (cache server or origin server). In some implementations theupstream response to the Range request is the entire file, and thisentire file is cached and the response to the downstream Range requestis extracted from this file and sent. However, in at least oneimplementation the upstream response to the Range request is just thedata bytes in the Range request itself, and these data bytes are notcached but instead just sent as the response to the downstream Rangerequest. As a result, use of Range headers by clients may have theconsequence that the file itself is never brought into caches and thedesirable scalability properties of the network will be lost.

In the foregoing, the operation of caching proxy servers was describedand also the method of requesting Blocks from a file which is anaggregations of multiple blocks was described. For example this can beachieved by the use of the HTTP Range request header. Such requests arecalled “partial requests” in the following. A further embodiment is nowdescribed which has advantage in the case that the block servinginfrastructure 101 does not provide complete support for the HTTP Rangeheader. Commonly, servers within a block serving infrastructure, forexample a Content Delivery Network, support partial requests but may notstore the response to partial requests in local storage (cache). Such aserver may fulfill a partial request by forwarding the request toanother server, unless the entire file is stored in local storage, inwhich case the response may be sent without forwarding the request toanother server.

A block-request streaming system which makes use of the novelenhancement of block aggregation described above may perform poorly ifthe block serving infrastructure exhibits this behavior, since allrequests, being partial requests, will be forwarded to another serverand no requests will be served by caching proxy servers, defeating theobject of providing the caching proxy servers in the first place. Duringthe block-request streaming process as described above, a client may atsome point request a Block which is at the beginning of a file.

According to the novel method here described, whenever a certaincondition is met, such requests may be converted from requests for thefirst Block in a file to requests for the entire file. When a requestfor the whole file is received by a caching proxy server the proxyserver typically stores the response. Therefore the use of theserequests causes the file to be brought into the cache of the localcaching proxy servers such that subsequent requests, whether for thefull file or partial requests may be served directly by the cachingproxy server. The condition may be such that amongst a set of requestsassociated with a given file, for example the set of requests generatedby a set of clients viewing the content item in question, the conditionwill be met for at least a provided fraction of these requests.

An example of a suitable condition is that a randomly chosen number isabove a provided threshold. This threshold may be set such that theconversion of a single Block request into a whole file request occurs onaverage for a provided fraction of the requests, for example one timeout of ten (in which case the random number may be chosen from theinterval [0,1] and the threshold may be 0.9). Another example of asuitable condition is that a hash function calculated over someinformation associated with the block and some information associatedwith the client takes one of a provided set of values. This method hasthe advantage that for a file which is frequently requested, the filewill be brought into the cache of a local proxy server however theoperation of the block-request streaming system is not alteredsignificantly from the standard operation in which each request is for asingle Block. In many cases, where the conversion of the request from asingle Block request to a whole file request occurs, the clientprocedures would otherwise go on to request the other Blocks within thefile. If this is the case, then such requests may be suppressed becausethe Blocks in question will be received in any case as a result of thewhole file request.

URL Construction and Segment List Generation and Seeking

The segment list generation deals with the issue of how a client maygenerate a segment list from the MPD at a specific client-local time NOWfor a specific representation which starts at some start time starttimeeither relative to the start of the media presentation for on-demandcases or expressed in wall-clock time. A segment list may comprise alocator, for example a URL to an optional initial representationmetadata, as well as a list of media segments. Each media segment mayhave been assigned a starttime, a duration and a locator. The starttimetypically expresses an approximation of the media time of the containedmedia in a segment, but not necessarily a sample accurate time. Thestarttime is used by the HTTP streaming client to issue the downloadrequest at the appropriate time. The generation of the segment list,including the start time of each, may be done in different ways. TheURLs may be provided as a play list or a URL construction rule mayadvantageously be used for a compact representation of the segment list.

A segment list based on URL construction may, for example, be carriedout if the MPD signals that by a specific attribute or element such asFileDynamicInfo or an equivalent signal. A generic way to create asegment list from a URL construction is provided below in the “URLConstruction Overview” section. A playlist-based construction may, forexample, be signaled by a different signal. Seeking in segment list andgetting to an accurate media time is also advantageously implemented inthis context.

URL Constructor Overview

As previously described, in one embodiment of the present inventionthere may be provided a metadata file containing URL construction ruleswhich allow client devices to construct the file identifiers for Blocksof the presentation. We now describe a further novel enhancement to theblock request streaming system which provides for changes in themetadata file, including changes to the URL construction rules, changesto the number of available encodings, changes to metadata associatedwith the available encodings such as bitrate, aspect ratio, resolution,audio or video codec or codec parameters or other parameters.

In this novel enhancement, there may be provided additional dataassociated with each element of the metadata file indicating a timeinterval within the overall presentation. Within this time interval theelement may be considered valid and otherwise the time interval theelement may be ignored. Furthermore, the syntax of the metadata may beenhanced such that elements previously allowed to appear only once or atmost once may appear multiple times. An additional restriction may beapplied in this case that provides that for such elements the specifiedtime intervals must be disjoint. At any given time instant, consideringonly the elements whose time interval contains the given time instantresults in a metadata file that is consistent with the original metadatasyntax. We call such time intervals validity intervals. This methodtherefore provides for signaling within a single metadata file changesof the kind described above. Advantageously, such a method can be usedto provide a media presentation that supports changes of the kinddescribed at specified points within the presentation.

URL Constructor

As described herein, a common feature of block-request streaming systemsis the need to provide the client with “metadata” that identifies theavailable media encodings and provides information needed by the clientto request the blocks from those encodings. For example in the case ofHTTP this information might comprise URLs for the files containing themedia blocks. A playlist file may be provided which lists the URLs forthe blocks for a given encoding. Multiple playlist files are provided,one for each encoding, together with a master playlist-of-playlists thatlists the playlists corresponding to the different encodings. Adisadvantage of this system is that the metadata can become quite largeand therefore takes some time to be requested when the client begins thestream. A further disadvantage of this system is evident in the case oflive content, when the files corresponding to the media data blocks aregenerated “on-the-fly” from a media stream which is being captured inreal time (live), for example a live sports event or news program. Inthis case the playlist files may be updated each time a new block isavailable (for example every few seconds). Client devices may repeatedlyfetch the playlist file to determine if new blocks are available andobtain their URLs. This may place a significant load on the servinginfrastructure and in particular means that metadata files cannot becached for longer than the update interval, which is equal to the blocksize which is commonly of the order of a few seconds.

One important aspect of a block-request streaming system is the methodused to inform clients of the file identifiers, for example URLs, thatshould be used, together with the file download protocol, to requestBlocks. For example, a method in which for each representation of apresentation there is provided a playlist file which lists the URLs ofthe files containing the Blocks of media data. A disadvantage of thismethod is that at least some of the playlist file itself needs to bedownloaded before playout can begin, increasing the channel zapping timeand therefore causing a poor user experience. For a long mediapresentation with several or many representations, the list of file URLsmay be large and hence the playlist file may be large further increasingthe channel zapping time.

Another disadvantage of this method occurs in the case of live content.In this case, the complete list of URLs is not made available in advanceand the playlist file is periodically updated as new blocks becomeavailable and clients periodically request the playlist file, in orderto receive the updated version. Because this file is frequently updatedit cannot be stored for long within the caching proxy servers. Thismeans that very many of the requests for this file will be forwarded toother servers and eventually to the server which generates the file. Inthe case of a popular media presentation this may result in a high loadon this server and the network, which may in turn result in a slowresponse time and therefore a high channel zapping time and poor userexperience. In the worst case the server becomes overloaded and thisresults in some users being unable to view the presentation.

It is desirable in the design of a block-request streaming system toavoid placing restrictions on the form of the file identifiers that maybe used. This is because a number of considerations may motivate the useof identifiers of a particular form. For example, in the case that theBlock Serving Infrastructure is a Content Delivery Network there may befile naming or storage conventions related to a desire to distributestorage or serving load across the network or other requirements whichlead to particular forms of file identifier which cannot be predicted atsystem design time.

A further embodiment is now described which mitigates the abovementioned disadvantages while retaining flexibility to chooseappropriate file identification conventions. In this method metadata maybe provided for each representation of the media presentation comprisinga file identifier construction rule. The file identifier constructionrule may for example comprise a text string. In order to determine thefile identifier for a given block of the presentation, a method ofinterpretation of the file identifier construction rule may be provided,this method comprising determination of input parameters and evaluationof the file identification construction rule together with the inputparameters. The input parameters may for example include an index of thefile to be identified, where the first file has index zero, the secondhas index one, the third has index two and so on. For example, in thecase that every file spans the same time duration (or approximately thesame time duration), then the index of the file associated with anygiven time within the presentation can easily be determined.Alternatively, the time within the presentation spanned by each file maybe provided within the presentation or version metadata.

In one embodiment, the file identifier construction rule may comprise atext string that may contain certain special identifiers correspondingto the input parameters. The method of evaluation of the file identifierconstruction rule comprises determining the positions of the specialidentifiers within the text string and replacing each such specialidentifier with a string representation of the value of thecorresponding input parameter.

In another embodiment, the file identifier construction rule maycomprise a text string conforming to an expression language. Anexpression language comprises a definition of a syntax to whichexpressions in the language may conform and a set of rules forevaluating a string conforming to the syntax.

A specific example will now be described, with reference to FIG. 21 etseq. An example of a syntax definition for a suitable expressionlanguage, defined in Augmented Backus-Naur Form, is as shown in FIG. 21.An example of rules for evaluating a string conforming to the<expression> production in FIG. 21 comprises recursively transformingthe string conformant to the <expression> production (an <expression>)into a string conformant to the <literal> production as follows:

An <expression> conformant to the <literal> production is unchanged.

An <expression> conformant to the <variable> production is replaced withthe value of the variable identified by the <token> string of the<variable> production.

An <expression> conformant to the <function> production is evaluated byevaluating each of its arguments according to these rules and applying atransformation to these arguments dependent on the <token> element ofthe <function> production as described below.

An <expression> conformant to the last alternative of the <expression>production is evaluated by evaluating the two <expression> elements andapplying an operation to these arguments dependent on the <operator>element of the last alternative of the <expression> production asdescribed below.

In the method described above it is assumed that the evaluation takesplace in a context in which a plurality of variables may be defined. Avariable is a (name, value) pair where “name” is a string conformant tothe <token> production and “value” is a string conformant to the<literal> production. Some variables may be defined outside theevaluation process before evaluation begins. Other variables may bedefined within the evaluation process itself. All variables are “global”in the sense that only one variable exists with each possible “name”

An example of a function is the “printf” function. This function acceptsone or more arguments. The first argument may be conformant to the<string> production (hereinafter a “string”). The printf functionevaluates to a transformed version of its first argument. Thetransformation applied is the same as the “printf” function of the Cstandard library, with the additional arguments included in the<function> production supplying the additional arguments expected by theC standard library printf function.

Another example of a function is the “hash” function. This functionaccepts two arguments, the first of which may be a string and the secondof which may be conformant to the <number> production (hereinafter a“number”). The “hash” function applies a hash algorithm to the firstargument and returns a results which is a nonnegative integer numberless than the second argument. An example of a suitable hash function isgiven in the C function shown in FIG. 22, whose arguments are the inputstring (excluding the enclosing quotation marks) and the numeric inputvalue. Other examples of hash functions are well known to those of skillin the art.

Another example of a function is the “Subst” function which takes one,two or three string arguments. In the case that one argument is suppliedthe result of the “Subst” function is the first argument. In the casethat two arguments are supplied then the result of the “Subst” functionis computed by erasing any occurrences of the second argument (excludingthe enclosing quotation marks) within the first argument and returningthe first argument so modified. In the case that three arguments aresupplied then the result of the “Subst” function is computed byreplacing any occurrences of the second argument (excluding theenclosing quotation marks) within the first argument with the thirdargument (excluding the enclosing quotation marks) and returning thefirst argument so modified.

Some examples of operators are the addition, subtraction, division,multiplication and modulus operators, identified by the <operator>productions ‘+’, ‘−’, ‘/’, ‘*’, ‘%’ respectively. These operatorsrequire that the <expression> productions either side of the <operator>production evaluate to numbers. The evaluation of the operator comprisesapplying the appropriate arithmetic operation (addition, subtraction,division, multiplication and modulus respectively) to these two numbersin the usual way and returning the result in a form compliant to the<number> production.

Another example of an operator is the assignment operator, identified bythe <operator> production ‘=’. This operator requires that the leftargument evaluates to a string the content of which is compliant to the<token> production. The content of a string is defined to be thecharacter string within the enclosing quotation marks. The equalityoperator causes the variable whose name is the <token> equal to thecontent of the left argument to be assigned a value equal to the resultof evaluating the right argument. This value is also the result ofevaluating the operator expression.

Another example of an operator is the sequence operator, identified bythe <operator> production ‘;’. The result of evaluating this operator isthe right argument. Note that as with all operators, both arguments areevaluated and the left argument is evaluated first.

In one embodiment of this invention the identifier of a file may beobtained by evaluating a file identifier construction rule according tothe above rule with a specific set of input variables which identify therequired file. An example of an input variable is the variable with name“index” and value equal to the numeric index of the file within thepresentation. Another example of an input variable is the variable withname “bitrate” and value equal to the average bitrate of the requiredversion of the presentation.

FIG. 23 illustrates some examples of file identifier construction rules,where the input variables are “id”, giving an identifier for therepresentation of the presentation desired and “seq”, giving a sequencenumber for the file

As will be clear to those of skill in the art upon reading thisdisclosure, numerous variations of the method above are possible. Forexample, not all the functions and operators described above may beprovided or additional functions or operators may be provided.

URL Construction Rules and Timing

This section provides basic URI Construction Rules to assign a file orsegment URI as well as a start time for each segment within arepresentation and the media presentation.

For this clause the availability of a media presentation description atthe client is assumed.

Assume that the HTTP streaming client is playing out media that isdownloaded within a media presentation. The HTTP client's actualpresentation time may be defined as to where the presentation time isrelative to the start of the presentation. At initialization, thepresentation time t=0 can be assumed.

At any point t, the HTTP client may download any data with play-time tP(also relative to the start of the presentation) at mostMaximumClientPreBufferTime ahead of the actual presentation time t andany data that is required due to a user interaction, e.g. seek,fast-forward, etc. In some embodiments the MaximumClientPreBufferTimemay not even be specified in a sense that a client can download dataahead of the current play-time tP without restrictions.

The HTTP client may avoid downloading unnecessary data, e.g. anysegments from representations that are not expected to be played-out maytypically not be downloaded.

The basic process in providing the streaming services may be thedownloading of data by the generation of appropriate requests todownload entire files/segments or subset of files/segments, for exampleby using HTTP GET requests or HTTP partial GET requests. Thisdescription addresses how to access the data for a specific play-time tPbut generally the client may download data for a larger time range ofplay-time to avoid inefficient requests. The HTTP client may minimizethe number/frequency of HTTP requests in providing the streamingservice.

For accessing media data at play-time tP or at least close to theplay-time tP in a specific representation the client determines the URLto the file that contains this play-time and in addition determines thebyte range in the file to access this play-time.

The Media Presentation Description may assign a representation id, r, toeach representation, for example by the use of the RepresentationIDattribute. In other words, the content of the MPD, when written by theingestion system or when read by the client, will be interpreted suchthat there is an assignment. In order to download data for a specificplay-time tP for a specific representation with id r, the client mayconstruct an appropriate URI for a file.

The Media Presentation Description may assign each file or segment ofeach representation r the following attributes:

(a) a sequence number i of the file within the representation r, withi=1, 2, . . . , Nr, (b) the relative start time of the file withrepresentation id r and file index i relative to the presentation time,defined as ts(r,i), (c) the file URI for the file/segment withrepresentation id r and file index i, denoted as FileURI(r, i).

In one embodiment the start time of the file and the file URIs may beprovided explicitly for a representation. In another embodiment, a listof file URIs may be provided explicitly where each file URI getsinherently assigned the index i according to the position in the listand the start time of the segment is derived as the sum of all segmentdurations for the segments from 1 to i−1. The duration of each segmentmay be provided according to any of the rules discussed above. Forexample, any skilled in basic mathematics may use other methods toderive a methodology to easily derive start time from a single elementor attribute and the position/index of the file URI in therepresentation.

If a dynamic URI construction rule is provided in the MPD, then thestart time of each file and each file URI may be constructed dynamicallyby using a construction rule, the index of the requested file andpotentially some additional parameters provided in the mediapresentation description. The information may for example be provided inMPD attributes and elements such as FileURIPattern and FileInfoDynamic.The FileURIPattern provides information on how to construct the URIsbased on the file index sequence number i and the representation ID r.The FileURIFormat is constructed as:

FileURIFormat=sprintf(“% s % s % s % s % s. % s”, BaseURI, BaseFileName,

RepresentationIDFormat, SeparatorFormat,

FileSequenceIDFormat, FileExtension);

and the FileURI(r,i) is constructed as

FileURI(r,i)=sprintf(FileURIFormat, r, i);

The relative start time ts(r,i) for each file/segment may be derived bysome attribute contained in the MPD describing the duration of thesegments in this representation, for example the FileInfoDynamicattribute. The MPD may also contain a sequence of FileInfoDynamicattributes that is global for all representations in the mediapresentation or at least for all representations in a period in the sameway as specified above. If media data for a specific play-time tP inrepresentation r is requested, the corresponding index i(r, tP) may bederived as i(r, t_(p)) such that that the play-time of this index is inthe interval of the start time of ts(r, i(r, tP)) and ts(r, i(r, tP)+1).The segment access may be further restricted by cases above, for examplethe segment is not accessible.

To access the exact play-time tP once the index and the URI of thecorresponding segment is obtained depends on the actual segment format.In this example assume that the media segments has a local time linethat starts at 0 without loss of generality. To access and present thedata at play-time tP the client may download the data corresponding tothe local time from the file/segment that can be accessed through theURI FileURI(r,i) with i=i(r, t_(p)).

Generally, clients may download the entire file and can then access theplay-time tP. However, not necessarily all information of the 3GP fileneeds to be downloaded, as the 3GP file provides structures to map thelocal timing to byte ranges. Therefore, only the specific byte ranges toaccess play-time tP may be sufficient to play the media as long assufficient random access information is available. Also sufficientinformation on structure and mapping of the byte range and the localtiming of the media segment may be provided in the initial part of thesegment, for example using a segment index. By having access to theinitial e.g., 1200 bytes of the segment, the client may have sufficientinformation to directly access the byte range necessary to play time tP.

In a further example assume that the segment index, possibly specifiedas the “tidx” box as below may be used to identify the byte offsets ofthe required Fragment or Fragments. Partial GET requests may be formedfor the required Fragment or Fragments. There are other alternatives,for example, the client may issue a standard request for the file andcancel this when the first “tidx” box has been received.

Seeking

A client may attempt to seek to a specific presentation time tp in arepresentation. Based on the MPD, the client has access to the mediasegment start time and media segment URL of each segment in therepresentation. The client may get the segment index segment_index ofthe segment most likely to contain media samples for presentation timetp as the maximum segment index i, for which the start time tS(r,i) issmaller or equal to the presentation time tp i.e.segment_index=max{i|tS(r,i)<=tp}. The segment URL is obtained asFileURI(r,i).

Note that timing information in the MPD may be approximate, due toissues related to placement of Random Access Points, alignment of mediatracks and media timing drift. As a result, the segment identified bythe procedure above may begin at a time slightly after tp and the mediadata for presentation time tp may be in the previous media segment. Inthe case of seeking, either the seek time may be updated to equal thefirst sample time of the retrieved file, or the preceding file may beretrieved instead. However, note that during continuous playout,including cases where there is a switch between alternativerepresentations/versions, the media data for the time between tp and thestart of the retrieved segment is nonetheless available.

For accurate seeking to a presentation time tp, the HTTP streamingclient needs to access a random access point (RAP). To determine therandom access point in a media segment in the case of 3GPP Adaptive HTTPStreaming, the client may, for example, use the information in the‘tidx’ or ‘sidx’ box, if present, to locate the random access points andthe corresponding presentation time in the media presentation. In caseswhere a segment is a 3GPP movie fragment, it is also possible for theclient to use information within the ‘moot’ and ‘mdat’ boxes, forexample, to locate RAPs and obtain the necessary presentation time fromthe information in the movie fragment and the segment start time derivedfrom the MPD. If no RAP with presentation time before the requestedpresentation time tp is available, the client may either access theprevious segment or may just use the first random access point as theseek result. When media segments start with a RAP, these procedures aresimple

Also note that not necessarily all information of the media segmentneeds to be downloaded to access the presentation time tp. The clientmay, for example, initially request the ‘tidx’ or ‘sidx’ box from thebeginning of the media segment using byte range requests. By use of the‘tidx’ or ‘sidx’ boxes, segment timing can be mapped to byte ranges ofthe segment. By continuously using partial HTTP requests, only therelevant parts of the media segment need be accessed, for improved userexperience and low start-up delays.

Segment List Generation

As described herein, it should be apparent how to implement astraightforward HTTP streaming client that uses the information providedby the MPD to create a list of segments for a representation that has asignalled approximate segment duration of dur. In some embodiments, theclient may assign the media segments within a representation consecutiveindices i=1, 2, 3, . . . , i.e., the first media segment is assignedindex i=1, the second media segment is assigned the index i=2, and soon. Then, the list of media segments with segment indices i is assignedstartTime[i] and URL[i] is generated, for example, as follows. First,the index i is set to 1. The start time of the first media segment isobtained as 0, startTime[1]=0. The URL of the media segment i, URL[i],is obtained as FileURI(r, i). The process is continued for all describedmedia segments with index i and the startTime[i] of media segment i isobtained as (i−1)*dur and the URL[i], is obtained as FileURI(r, i).

Concurrent HTTP/TCP Requests

A concern in a block-request streaming system is a desire to alwaysrequest the highest-quality blocks that can be completely received intime for playout. However, the data arrival rate may not be known inadvance and so it may happen that a requested block does not arrive intime to be played out. This results in a need to pause the mediaplayout, which results in a poor user experience. This problem can bemitigated by client algorithms that take a conservative approach to theselection of blocks to request by requesting blocks of lower quality(and so of lower size) that are more likely to be received in time, evenif the data arrival rate falls during the reception of the block.However this conservative approach has the disadvantage of possiblydelivering a lower quality playout to the user or destination device,which is also a poor user experience. The problem may be magnified whenmultiple HTTP connections are used at the same time to downloaddifferent blocks, as described below, since available network resourcesare shared across connections and thus are being simultaneously used forblocks with different playout times.

It may be advantageous for the client to issue requests for multipleblocks concurrently, where in this context “concurrently” meansresponses to requests are occurring in overlapping time intervals, andit is not necessarily the case that the requests are made at preciselyor even approximately the same time. In the case of the HTTP protocol,this approach may improve utilization of the available bandwidth due tothe behavior of the TCP protocol (as is well known). This can beespecially important to improve the content zapping time, as when a newcontent is first requested the corresponding HTTP/TCP connections overwhich data for the blocks is requested might be slow to start, and thususing several HTTP/TCP connections at this point can dramatically speedup the data delivery time of the first blocks. However, requestingdifferent blocks or fragments over different HTTP/TCP connections canalso lead to degraded performance, as the requests for the blocks thatare to be played out first are competing with the requests for thesubsequent blocks, competing HTTP/TCP downloads vary greatly in theirdelivery speed and thus the completion time of the request can be highlyvariable, and it is generally not possible to control which HTTP/TCPdownloads will completely quickly and which will be slower, and thus itis likely that at least some of the time the HTTP/TCP downloads of thefirst few blocks will be the last to complete, thus leading to large andvariable channel zapping times.

Suppose that each block or fragment of a segment is downloaded over aseparate HTTP/TCP connection, and that the number of parallelconnections is n and the playout duration of each block is t seconds,and that the streaming rate of the content associated with the segmentis S. When the client first begins to stream the content, requests maybe issued for the first n blocks, representing n*t seconds of mediadata.

As is known to those of skill in the art, there is a large variation inthe data rate of TCP connections. However, to simplify this discussion,suppose ideally that all connections are proceeding in parallel suchthat the first block will be completely received at about the same timeas the other n−1 blocks requested. To simplify the discussion further,assume that the aggregate bandwidth utilized by the n downloadconnections is fixed to a value B for the entire duration of thedownload, and that the streaming rate S is constant over the entirerepresentation. Suppose further that the media data structure is suchthat playout of a block can be done when the entire block is availableat the client, i.e., playout of a block can only start after the entireblock is received, e.g., due to the structure of the underlying videoencoding, or because encryption is being employed to encrypt eachfragment or block separately, and thus the entire fragment or blockneeds to be received before it can be decrypted. Thus, to simplify thediscussion below, we assume that an entire block needs to be receivedbefore any of the block can be played out. Then, the time requiredbefore the first block has arrived and can be played out isapproximately n*t*S/B.

Since it is desirable to minimize content zapping time, it is thereforedesirable to minimize n*t*S/B. The value of t may be determined byfactors such as the underlying video encoding structure and how theingestion methods are utilized, and thus t can be reasonably small, butvery small values of t lead to an overly complicated segment map andpossibly may be incompatible with efficient video encoding anddecryption, if used. The value of n may also affect the value of B,i.e., B may be larger for a larger number n of connections, and thusreducing the number of connections, n, has the negative side effect ofpotentially reducing the amount of available bandwidth that is utilized,B, and so may not be effective in achieving the goal of reducing thecontent zapping time. The value of S depends on which representation ischosen to download and playout, and ideally S should be as close to B aspossible in order to maximize the playout quality of the media for thegiven network conditions. Thus, to simplify this discussion, assume thatS is approximately equal to B. Then, the channel zapping time isproportional to n*t. Thus, utilizing more connections to downloaddifferent fragments can degrade the channel zapping time if theaggregate bandwidth utilized by the connections is sub-linearlyproportional to the number of connections, which is typically the case.

As an example, suppose t=1 second, and with n=1 the value of B=500 Kbps,and with n=2 the value of B=700 Kbps, and with n=3 the value of B=800Kbps. Suppose that the representation with S=700 Kbps is chosen. Then,with n=1 the download time for the first block is 1*700/500=1.4 seconds,with n=2 the download time for the first block is 2*700/700=2 seconds,and with n=3 the download time for the first block is 3*700/800=2.625seconds. Furthermore, as the number of connections increases thevariability in the individual download speeds of the connections islikely to increase (although even with one connection there is likely tobe some significant variability). Thus, in this example, the channelzapping time and the variability in the channel zapping time increasesas the number of connections increases. Intuitively, the blocks that arebeing delivered have different priorities, i.e., the first block has theearliest delivery deadline, the second block has the second earliestdeadline, etc., whereas the download connections over which the blocksare being delivered are competing for network resources during thedelivery, and thus the blocks with the earliest deadlines become moredelayed as more competing blocks are requested. On the other hand, evenin this case, ultimately using more than one download connection allowssupport of a sustainably higher streaming rate, e.g, with threeconnections a streaming rate of up to 800 Kbps can be supported in thisexample, whereas only a stream of 500 Kbps can be supported with oneconnection.

In practice, as noted above, the data rate of a connection may be highlyvariable both within the same connection over time and betweenconnections and, as a result, the n requested blocks generally do notcomplete at the same time and in fact it can commonly be the case thatone block may complete in half the time of another block. This effectresults in unpredictable behavior since in some cases the first blockmay complete much sooner than other blocks and in other cases the firstblock may complete much later than other blocks, and as a result thebeginning of playout may in some cases occur relatively quickly and inother cases may be slow to occur. This unpredictable behavior may befrustrating for the user and may therefore be considered a poor userexperience.

What is needed therefore are methods in which multiple TCP connectionscan be utilized to improve the channel zapping time and the variabilityin channel zapping time, while at the same time supporting a goodquality streaming rate possible. What is also needed are methods toallow for the share of available bandwidth allocated to each block to beadjusted as the playout time of a block approaches, so that, ifnecessary, a greater share of available bandwidth can be allocatedtowards the block with the nearest playout time.

Cooperative HTTP/TCP Requesting

We now describe methods for using concurrent HTTP/TCP requests in acooperative fashion. A receiver may employ multiple concurrentcooperative HTTP/TCP requests, for example using a plurality of HTTPbyte-range requests, wherein each such request is for a portion of afragment in a source segment, or all of a fragment of a source segment,or a portion or a repair fragment of a repair segment, or for all of arepair fragment of a repair segment.

The advantages of cooperative HTTP/TCP requests together with usage ofFEC repair data may be especially important to provide consistentlyquick channel zapping times. For example, at a channel zapping time itis likely that the TCP connections have either just been started or havebeen idle for some period of time, in which case the congestion window,cwnd, is at its minimal value for the connections, and thus the deliveryspeed of these TCP connections will take several round-trip times (RTTs)to ramp up, and there will be high variability in the delivery speedsover the different TCP connections during this ramp-up time.

An overview of the No-FEC method is now described, which is acooperative HTTP/TCP request method wherein only media data of sourceblocks is requested using multiple concurrent HTTP/TCP connections,i.e., no FEC repair data is requested. With the No-FEC method, portionsof the same fragment are requested over different connections, e.g.,using HTTP byte range requests for portions of the fragment, and thusfor example each HTTP byte range request is for a portion of the byterange indicated in the segment map for the fragment. It may be the casethat an individual HTTP/TCP request ramps up it delivery speed to fullyutilize the available bandwidth over several RTTs (round-trip times),and thus there is a relative long period of time where the deliveryspeed is less than the available bandwidth, and thus if a singleHTTP/TCP connection is used to download for example the first fragmentof a content to be played out, the channel zapping time could be large.Using the No-FEC method, downloading different portions of the samefragment over different HTTP/TCP connections can significantly reducethe channel zapping time.

An overview of the FEC method is now described, which is a cooperativeHTTP/TCP request method wherein media data of a source segment and FECrepair data generated from the media data is requested using multipleconcurrent HTTP/TCP connections. With the FEC method, portions of thesame fragment and FEC repair data generated from that fragment arerequested over different connections, using HTTP byte range requests forportions of the fragment, and thus for example each HTTP byte rangerequest is for a portion of the byte range indicated in the segment mapfor the fragment. It may be the case that an individual HTTP/TCP requestramps up it delivery speed to fully utilize the available bandwidth overseveral RTTs (round-trip times), and thus there is a relative longperiod of time where the delivery speed is less than the availablebandwidth, and thus if a single HTTP/TCP connection is used to downloadfor example the first fragment of a content to be played out, thechannel zapping time could be large. Using the FEC method has the sameadvantages as the No-FEC method, and has the additional advantage thatnot all of the requested data needs to arrive before the fragment can berecovered, thus further reducing the channel zapping time and thevariability in the channel zapping time. By making requests overdifferent TCP connections, and over-requesting by also requesting FECrepair data on at least one of the connections, the amount of time ittakes to deliver a sufficient amount of data to for example recover thefirst requested fragment that enables media playback to start, can begreatly reduced and made to be much more consistent than if cooperativeTCP connections and FEC repair data was not used.

FIGS. 24(a)-(e) show an example of the delivery rate fluctuations of 5TCP connections running over the same link to the same client from thesame HTTP web server of an emulated evolution data optimized (EVDO)network. In FIGS. 24(a)-(e), the X-axis shows time in seconds, and theY-axis shows the rate at which bits are received at the client over eachof the 5 TCP connections measured over intervals of 1 second, for eachconnection. In this particular emulation, there were 12 TCP connectionsin total running over this link, and thus the network was relativelyloaded during the time shown, which might be typical when more than oneclient is streaming within the same cell of a mobile network. Note thatalthough the delivery rates are somewhat correlated over time, there arewide difference in the delivery rates of the 5 connections at manypoints in time.

FIG. 25 shows a possible request structure for a fragment that is250,000 bits in size (approximately 31.25 kilobytes), where there are 4HTTP byte range requests made in parallel for different parts of thefragment, i.e., the first HTTP connection requests the first 50,000bits, the second HTTP connection requests the next 50,000 bits, thethird HTTP connection requests the next 50,000 bits, and the fourth HTTPconnection requests the next 50,000 bits. If FEC is not used, i.e., theNo-FEC method, then these are the only 4 requests for the fragment inthis example. If FEC is used, i.e., the FEC method, then in this examplethere is one additional HTTP connection that requests an additional50,000 bits of FEC repair data of a repair segment generated from thefragment.

FIG. 26 is a blowup of the first couple of seconds of the 5 TCPconnections shown in Fig. FIGS. 24(a)-(e), where in FIG. 26 the X-axisshows time at intervals of 100 milliseconds, and the Y-axis shows therate at which bits are received at the client over each of the 5 TCPconnections measured over intervals of 100 milliseconds. One line showsthe aggregate amount of bits that has been received at the client forthe fragment from the first 4 HTTP connections (excluding the HTTPconnection over which FEC data is requested), i.e., what arrives usingthe No-FEC method. Another line shows the aggregate amount of bits thathas been received at the client for the fragment from all 5 of the HTTPconnections (including the HTTP connection over which FEC data isrequested), i.e., what arrives using the FEC method. For the FEC method,it is assumed that the fragment can be FEC decoded from reception of any200,000 bits of the 250,000 requested bits, which can be realized if forexample a Reed-Solomon FEC code is used, and which can be essentiallyrealized if for example the RaptorQ code described in Luby IV is used.For the FEC method in this example, enough data is received to recoverthe fragment using FEC decoding after 1 second, allowing a channelzapping time of 1 second (assuming that the data for subsequentfragments can be requested and received before the first fragment isfully played out). For the No-FEC method in this example, all the datafor the 4 requests has to be received before the fragment can berecovered, which occurs after 1.7 seconds, leading to a channel zappingtime of 1.7 seconds. Thus, in the example shown in FIG. 26, the No-FECmethod is 70% worse in terms of channel zapping time than the FECmethod. One of the reasons for the advantage shown by the FEC method inthis example is that, for the FEC method, reception of any 80% of therequested data allows recovery of the fragment, whereas for the No-FECmethod, reception of 100% of the requested data is required. Thus, theNo-FEC method has to wait for the slowest TCP connection to finishdelivery, and because of natural variations in the TCP delivery ratethere is apt to be wide variance in the delivery speed of the slowestTCP connection compared to an average TCP connection. With the FECmethod in this example, one slow TCP connection does not determine whenthe fragment is recoverable. Instead, for the FEC method, the deliveryof enough data is much more a function of the average TCP delivery ratethan the worse case TCP delivery rate.

There are many variations of the No-FEC method and the FEC methoddescribed above. For example, the cooperative HTTP/TCP requests may beused for only the first few fragments after a channel zap has occurred,and thereafter only a single HTTP/TCP request is used to downloadfurther fragments, multiple fragments, or entire segments. As anotherexample, the number of cooperative HTTP/TCP connections used can be afunction of both the urgency of the fragments being requested, i.e., howimminent is the playout time of these fragments, and of the currentnetwork conditions.

In some variations, a plurality of HTTP connections may be used torequest repair data from repair segments. In other variations, differentamounts of data may be requested on different HTTP connections, forexample depending on the current size of the media buffer and the rateof data reception at the client. In another variation, the sourcerepresentations are not independent of one another, but insteadrepresent a layered media coding, where for example an enhanced sourcerepresentation may depend on a base source representation. In this case,there may be a repair representation corresponding to the base sourcerepresentation, and another repair representation corresponding to thecombination of the base and enhancement source representations.

Additional overall elements add to the advantages one may realize by themethods disclosed above. For example, the number of HTTP connectionsused may vary depending on the current amount of media in the mediabuffer, and/or the rate of reception into the media buffer. CooperativeHTTP requests using FEC, i.e., the FEC method described above andvariants of that method, can be used aggressively when the media bufferis relatively empty, e.g., more cooperative HTTP requests are made inparallel for different parts of the first fragment, requesting all ofthe source fragment and a relatively large fraction of the repair datafrom the corresponding repair fragment, and then transitioning to areduced number of concurrent HTTP requests, requesting larger portionsof the media data per request, and requesting a smaller fraction ofrepair data, e.g., transitioning to 1, 2 or 3 concurrent HTTP requests,transitioning to making requests for full fragments or multipleconsecutive fragments per request, and transitioning to requesting norepair data, as the media buffer grows.

As another example, the amount of FEC repair data might vary as afunction of the media buffer size, i.e., when the media buffer is smallthen more FEC repair data might be requested, and as the media buffergrows then the amount of FEC repair data requested might diminish, andat some point when the media buffer is sufficiently large then no FECrepair data may be requested, only data from source segments of sourcerepresentations. The benefits of such enhanced techniques is that theymay allow faster and more consistent channel zapping times, and moreresilience against potential media stutters or stalls, while at the sametime minimizing the amount of additional bandwidth used beyond theamount that would be consumed by just delivering the media in the sourcesegments by reducing both request message traffic and FEC repair data,while at the same time enabling support of the highest media ratespossible for the given network conditions.

Additional Enhancements when Using Concurrent HTTP Connections

An HTTP/TCP request may be abandoned if a suitable condition is met andanother HTTP/TCP request may be made to download data that may replacethe data requested in the abandoned request, wherein the second HTTP/TCPrequest may request exactly the same data as in the original request,e.g., source data; or overlapping data, e.g., some of the same sourcedata and repair data that had not been requested in the first request;or completely disjoint data, e.g., repair data that had not beenrequested in the first request. An example of a suitable condition isthat a request fails due to the absence of a response from the BlockServer Infrastructure (BSI) within a provided time or a failure in theestablishment of a transport connection to the BSI or receipt of anexplicit failure message from the server or another failure condition.

Another example of a suitable condition is that receipt of data isproceeding unusually slowly, according to a comparison of a measure ofthe connection speed (data arrival rate in response to the request inquestion) with the expected connection speed or with an estimate of theconnection speed required to receive the response before the playouttime of the media data contained therein or another time dependent uponthat time.

This approach has advantage in the case that the BSI sometimes exhibitsfailures or poor performance. In this case the approach above increasesthe probability that the client can continue reliable playout of themedia data despite failures or poor performance within the BSI. Notethat in some cases there may be advantage to designing the BSI in such away that it does exhibit such failures or poor performance on occasions,for example such a design may have a lower cost than an alternativedesign that does not exhibit such failures or poor performance or whichexhibits these less often. In this case the method described herein hasfurther advantage in that it permits the utilization of such a lowercost design for the BSI without a consequent degradation in the userexperience.

In another embodiment, the number of requests issued for datacorresponding to a given block may be dependent on whether a suitablecondition with respect to the block is met. If the condition is not metthen the client may be restricted from making further requests for theblock if the successful completion of all currently incomplete datarequests for the block would allow recovery of the block with highprobability. If the condition is met then a larger number of requestsfor the block may be issued, i.e., the restriction above does not apply.An example of a suitable condition is that the time until the scheduledplayout time of the block or another time dependent on that time fallsbelow a provided threshold. This method has advantage because additionalrequests for data for a block are issued when receipt of the blockbecomes more urgent, because the play out time of the media datacomprising the block is close. In the case of common transport protocolssuch as HTTP/TCP, these additional requests have the effect ofincreasing the share of the available bandwidth dedicated to data thatcontributes to reception of the block in question. This reduces the timerequired for reception of sufficient data to recover the block tocomplete and therefore reduces the probability that the block cannot berecovered before the scheduled play out time of the media datacomprising the block. As described above, if the block cannot berecovered before the scheduled play out time of the media datacomprising the block than the playout may pause resulting in a poor userexperience and therefore the method described here advantageouslyreduces the probability of this poor user experience.

It should be understood that throughout this specification references tothe scheduled playout time of a block refers to the time at which theencoded media data comprising the block may first be available at theclient in order to achieve playout of the presentation without pausing.As will be clear to those of skill in the art of media presentationsystems, this time is in practice slightly before the actual time of theappearance of the media comprising the block at the physical transducersused for playout (screen, speaker etc.) since several transformationfunctions may need to be applied to the media data comprising the blockto effect actual playout of that block and these functions may require acertain amount of time to complete. For example media data is generallytransported in compressed form and a decompression transformation may beapplied.

Methods for Generating File Structures Supporting Cooperative HTTP/FECMethods

An embodiment to generate a file structure that may be usedadvantageously by a client employing cooperative HTTP/FEC methods is nowdescribed. In this embodiment, for each source segment there is acorresponding repair segment generated as follows. The parameter Rindicates on average how much FEC repair data is generated for thesource data in the source segments. For example, R=0.33 indicates thatif a source segment contains 1,000 kilobytes of data, then thecorresponding repair segment contains approximately 330 kilobytes ofrepair data. The parameter S indicates the symbol size in bytes used forFEC encoding and decoding. For example, S=64 indicates that the sourcedata and the repair data comprises symbols of size 64 bytes each for thepurposes of FEC encoding and decoding.

The repair segment can be generated for a source segment as follows.Each fragment of the source segment is considered as a source block forFEC encoding purposes, and thus each fragment is treated as a sequenceof source symbols of a source block from which repair symbols aregenerated. The number of repair symbols in total generated for the firsti fragments is calculated as TNRS(i)=ceiling(R*B(i)/S), whereinceiling(x) is the function that outputs the smallest integer with avalue that is at least x. Thus, the number of repair symbols generatedfor fragment i is NRS(i)=TNRS(i) −TNRS(i−1).

The repair segment comprises a concatenation of the repair symbols forthe fragments, wherein the order of the repair symbols within a repairsegment is in the order of the fragments from which they are generated,and within a fragment the repair symbols are in order of their encodingsymbol identifier (ESI). The repair segment structure corresponding to asource segment structure is shown in FIG. 27, including a repair segmentgenerator 2700.

Note that by defining the number of repair symbols for a fragment asdescribed above, the total number of repair symbols for all previousfragments, and thus the byte index into the repair segment, only dependson R, S, B(i−1) and B(i), and does not depend on any of the previous orsubsequent structure of the fragments within the source segment. This isadvantageous because it allows a client to quickly compute the positionof the start of a repair block within the repair segment, and alsoquickly compute the number of repair symbols within that repair block,using only local information about the structure of the correspondingfragment of the source segment from which the repair block is generated.Thus, if a client decides to start downloading and playout of a fragmentfrom the middle of a source segment, it can also quickly generate andaccess the corresponding repair block from within the correspondingrepair segment.

The number of source symbols in the source block corresponding tofragment i is calculated as NSS(i)=ceiling((B(i)−B(i−1))/S). The lastsource symbol is padded out with zero bytes for the purposes of FECencoding and decoding if B(i)−B(i−1) is not a multiple of S, i.e., thelast source symbol is padded out with zero bytes so that it is S bytesin size for the purposes of FEC encoding and decoding, but these zeropadding bytes are not stored as part of the source segment. In thisembodiment, the ESIs for the source symbol are 0, 1, . . . , NSS(i)−1and the ESIs for the repair symbols are NSS(i), NSS(i)+NRS(i)−1.

The URL for a repair segment in this embodiment can be generated fromthe URL for the corresponding source segment by simply adding forexample the suffix “.repair” to the URL of the source segment.

The repair indexing information and FEC information for a repair segmentis implicitly defined by the indexing information for the correspondingsource segment, and from the values of R and S, as described herein. Thetime offsets and the fragment structure comprising the repair segmentare determined by the time offsets and structure of the correspondingsource segment. The byte offset to the end of the repair symbols in therepair segment corresponding to fragment i can be calculated asRB(i)=S*ceiling(R*B(i)/S). The number of bytes in the repair segmentcorresponding to fragment i is then RB(i)−RB(i−1), and thus the numberof repair symbols corresponding to fragment i is calculated asNRS(i)=(RB(i)−RB(i−1))/S. The number of source symbols corresponding tofragment i can be calculated as NSS(i)=ceiling((B(i)−B(i−1))/S). Thus,in this embodiment, the repair indexing information for a repair blockwithin a repair segment and the corresponding FEC information can beimplicitly derived from R, S and the indexing information for thecorresponding fragment of the corresponding source segment.

As an example, consider the example shown in FIG. 28, showing a fragment2 that starts at byte offset B(1)=6,410 and ends at byte offsetB(2)=6,770. In this example, the symbol size is S=64 bytes, and thedotted vertical lines show the byte offsets within the source segmentthat correspond to multiples of S. The overall repair segment size as afraction of the source segment size is set to R=0.5 in this example. Thenumber of source symbols in the source block for fragment 2 iscalculated as NSS(2)=ceiling((6,770−6,410)/64)=ceil(5.625)=6, and these6 source symbols have ESIs 0, . . . , 5, respectively, wherein the firstsource symbol is the first 64 bytes of fragment 2 that starts at byteindex 6,410 within the source segment, the second source symbol is thenext 64 bytes of fragment 2 that starts at byte index 6,474 within thesource segment, etc. The end byte offset of the repair blockcorresponding to fragment 2 is calculated asRB(2)=64*ceiling(0.5*6,770/64)=64*ceiling(52.89 . . . )=64*53=3,392, andthe start byte offset of the repair block corresponding to fragment 2 iscalculated as RB(1)=64*ceiling(0.5*6,410/64)=64*ceiling(50.07 . . .)=64*51=3,264, and thus in this example there are two repair symbols inthe repair block corresponding to fragment 2 with ESIs 6 and 7,respectively, starting at byte offset 3,264 within the repair segmentand ending at byte offset 3,392.

Note that, in the example shown in FIG. 28, even though R=0.5 and thereare 6 source symbols corresponding to fragment 2, the number of repairsymbols is not 3, as one might expect if one simply used the number ofsource symbols to calculate the number of repair symbols, but insteadworked out to be 2 according to the methods described herein. As opposedto simply using the number of source symbols of a fragment to determinethe number of repair symbols, the embodiments described above make itpossible to calculate the positioning of the repair block within therepair segment solely from the index information associated with thecorresponding source block of the corresponding source segment.Furthermore, as the number, K. of source symbols in a source blockgrows, the number of repair symbols, KR, of the corresponding repairblock is closely approximated by K*R, as in general, KR is at mostceil(K*R) and KR is at least floor((K−1)*R), where floor(x) is thelargest integer that is at most x.

There are many variations of the above embodiments for generating a filestructure that may be used advantageously by a client employingcooperative HTTP/FEC methods, as one skilled in the art will recognize.As an example of an alternate embodiment, an original segment for arepresentation may be partitioned into N>1 parallel segments, whereinfor i=1, . . . , N, a specified fraction F_(i) of the original segmentis contained in the ith parallel segment, and where the sum for i=1, . .. , N of F, is equal to 1. In this embodiment, there may be one mastersegment map that is used to derive the segment maps for all of theparallel segments, similar to how the repair segment map is derived fromthe source segment map in the embodiment described above. For example,the master segment map may indicate the fragment structure if all of thesource media data was not partitioned in parallel segments but insteadcontained in the one original segment, and then the segment map for theith parallel segment can be derived from the master segment map bycalculating that, if the amount of media data in a first prefix offragments of the original segment is L bytes, then the total number ofbytes of this prefix in aggregate among the first i parallel segment isceil(L*G_(i)), where G_(i) is the sum over j=1, . . . , i of F_(j). Asanother example of an alternate embodiment, the segments may consist ofthe combination of the original source media data for each fragmentfollowed immediately by the repair data for that fragment, resulting ina segment that contains a mixture of source media data and repair datagenerated using an FEC code from that source media data. As anotherexample of an alternate embodiment, a segment that contains a mixture ofsource media data and repair data may be partitioned into multipleparallel segments containing a mixture of source media data and repairdata.

Further embodiments can be envisioned to one of ordinary skill in theart after reading this disclosure. In other embodiments, combinations orsub-combinations of the above disclosed invention can be advantageouslymade. The example arrangements of components are shown for purposes ofillustration and it should be understood that combinations, additions,re-arrangements, and the like are contemplated in alternativeembodiments of the present invention. Thus, while the invention has beendescribed with respect to exemplary embodiments, one skilled in the artwill recognize that numerous modifications are possible.

For example, the processes described herein may be implemented usinghardware components, software components, and/or any combinationthereof. In some cases, the software components can be provided ontangible, non-transitory media for execution on hardware that isprovided with the media or is separate from the media. The specificationand drawings are, accordingly, to be regarded in an illustrative ratherthan a restrictive sense. It will, however, be evident that variousmodifications and changes may be made thereunto without departing fromthe broader spirit and scope of the invention as set forth in the claimsand that the invention is intended to cover all modifications andequivalents within the scope of the following claims.

What is claimed is:
 1. A method of processing media data, comprising:encoding, at a media ingestion system, a first version of a mediapresentation, wherein the first version is a data rate version that isto be made available; selecting random access points within the firstversion based on a commonality of seek point frames with previous framesand a compression efficiency of the encoding, subject to a minimumtemporal spacing defining a maximum duration between the random accesspoints, wherein the random access points are seek points within thefirst version; encoding, a second version of the media presentation,wherein the second version is a different data rate version that is tobe made available; and selecting random access points within the secondversion to temporally match the random access points within the firstversion at least in part by matching positions of the random accesspoints within the second version with positions of the random accesspoints within the first version, wherein the random access points withinthe second version are seek points within the second version.
 2. Amethod of processing media data, comprising: encoding, at a mediaingestion system, a first version of a media presentation, wherein thefirst version is a data rate version that is to be made available;selecting random access points within the first version based on acommonality of seek point frames with previous frames and a compressionefficiency of the encoding, subject to a minimum temporal spacingdefining a maximum duration between the random access points, whereinthe random access points are seek points within the first version;encoding, a second version of the media presentation, wherein the secondversion is a different data rate version that is to be made available;and selecting random access points within the second version that aretemporally independent of the random access points within the firstversion, wherein the random access points within the second version areseek points within the second version.
 3. The method of claim 2, whereinthe encoding of the first version of the media presentation is performedindependently of the encoding of the second version of the mediapresentation.
 4. A method of processing media data, comprising:receiving, at a client device, a first version of a media presentation,wherein the first version is a data rate version that is to be madeavailable and wherein the first version has a first set of random accesspoints, wherein the first set of random access points are seek pointswithin the first version and are selected based on a commonality of seekpoint frames with previous frames and a compression efficiency ofencoding, subject to a minimum temporal spacing defining a maximumduration between the first set of random access points; and receiving,at the client device, a second version of a media presentation, whereinthe second version is a data rate version that is to be made availableand wherein the second version has a second set of random access pointsthat are temporally independent of the first set of random accesspoints, wherein the second set of random access points within the secondversion are seek points within the second version.
 5. The method ofclaim 4, further comprising: presenting media by consuming the firstversion of the media presentation; and switching to consuming the secondversion of the media presentation without interrupting the presenting ofthe media, wherein the switching occurs between a first random accesspoint from the first set of random access points and a second randomaccess point from the second set of random access points.
 6. A mediaingestion system, comprising: a memory; and a processor in communicationwith the memory, the processor configured to: encode a first version ofa media presentation, wherein the first version is a data rate versionthat is to be made available; select random access points within thefirst version based on a commonality of seek point frames with previousframes and a compression efficiency of encoding, subject to a minimumtemporal spacing defining a maximum duration between the random accesspoints, wherein the random access points are seek points within thefirst version; encode a second version of the media presentation,wherein the second version is a different data rate version that is tobe made available; and select random access points within the secondversion to temporally match the random access points within the firstversion at least in part by matching positions of the random accesspoints within the second version with positions of the random accesspoints within the first version, wherein the random access points withinthe second version are seek points within the second version.
 7. A mediaingestion system, comprising: a memory; and a processor in communicationwith the memory, the processor configured to: encode a first version ofa media presentation, wherein the first version is a data rate versionthat is to be made available; select random access points within thefirst version based on a commonality of seek point frames with previousframes and a compression efficiency of encoding, subject to a minimumtemporal spacing defining a maximum duration between the random accesspoints, wherein the random access points are seek points within thefirst version; encode a second version of the media presentation,wherein the second version is a different data rate version that is tobe made available; and select random access points within the secondversion that are temporally independent of the random access pointswithin the first version, wherein the random access points within thesecond version are seek points within the second version.
 8. The mediaingestion system of claim 7, wherein the processor is configured toencode the first version of the media presentation independently of thesecond version of the media presentation.
 9. A client device,comprising: a memory; a receiver for requesting media data from a mediaingestion system; and a processor in communication with the memory andthe receiver, the processor configured to: receive a first version of amedia presentation, wherein the first version is a data rate versionthat is to be made available and wherein the first version has a firstset of random access points selected based on a commonality of seekpoint frames with previous frames and a compression efficiency ofencoding, subject to a minimum temporal spacing defining a maximumduration between the first set of random access points, wherein thefirst set of random access points are seek points within the firstversion; and receive a second version of a media presentation, whereinthe second version is a data rate version that is to be made availableand wherein the second version has a second set of random access pointsthat are temporally independent of the first set of random accesspoints, wherein the second set of random access points within the secondversion are seek points within the second version.
 10. The client deviceof claim 9, wherein the processor is further configured to: presentmedia by consuming the first version of the media presentation; andswitch to consuming the second version of the media presentation withoutinterrupting the presenting of the media, wherein the switching occursbetween a first random access point from the first set of random accesspoints and a second random access point from the second set of randomaccess points.